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

Full description

Saved in:
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
Algorithmics
Parameterized Complexity
Mathematik
Graph algorithms
Analysis of social networks
Parametrisierte Komplexität, Graph Algorithmen, Analyse sozialer Netzwerke
Mathematics
Online Access:PDF Full Text
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

PDF Full Text

Holdings details from
Call Number: urn:nbn:de:hebis:04-z2023-00613
Publication Date: 2023-03-09
Date of Acceptance: 2022-11-17
Downloads: 56 (2024), 146 (2023)
License: https://creativecommons.org/licenses/by-nc-sa/4.0
Access URL: https://archiv.ub.uni-marburg.de/diss/z2023/0061
https://doi.org/10.17192/z2023.0061

Similar Items