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

Full description

Bibliographic Details

Main Author:	Sommer, Frank
Contributors:	Komusiewicz, Christian (Prof. Dr.) (Thesis advisor)
Format:	Doctoral Thesis
Language:	English
Published:	Philipps-Universität Marburg 2022
Subjects:	Algorithmik Mathematik Algorithmics Analysis of social networks Graph algorithms Parametrisierte Komplexität, Graph Algorithmen, Analyse sozialer Netzwerke Parameterized Complexity Mathematics
Online Access:	PDF Full Text
Tags:	Add Tag No Tags, Be the first to tag this record!