On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations

On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations

We study various subgraph problems with applications for example in community detection. In these applications vertices represent agents in a social network or genes in a biological network, and edges represent interactions of the agents or genes, respectively. All of the problems studied in this...

Disgrifiad llawn

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Prif Awdur: Sommer, Frank
Awduron Eraill: Komusiewicz, Christian (Prof. Dr.) (Cynghorydd traethodau ymchwil)
Fformat: Dissertation
Iaith:Saesneg
Cyhoeddwyd: Philipps-Universität Marburg 2022
Pynciau:
Algorithmik
Algorithmics
Parameterized Complexity
Mathematik
Graph algorithms
Analysis of social networks
Parametrisierte Komplexität, Graph Algorithmen, Analyse sozialer Netzwerke
Mathematics
Mynediad Ar-lein:Testun PDF llawn
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
No citations were found for this record.

Eitemau Tebyg