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...

Fuld beskrivelse

Gespeichert in:
Bibliografiske detaljer
Hovedforfatter: Sommer, Frank
Andre forfattere: Komusiewicz, Christian (Prof. Dr.) (BetreuerIn (Doktorarbeit))
Format: Dissertation
Sprog:engelsk
Udgivet: Philipps-Universität Marburg 2022
Fag:
Algorithmik
Algorithmics
Parameterized Complexity
Mathematik
Graph algorithms
Analysis of social networks
Parametrisierte Komplexität, Graph Algorithmen, Analyse sozialer Netzwerke
Mathematics
Online adgang:PDF-Volltext
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
No citations were found for this record.

Lignende værker