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...
Gespeichert in:
1. Verfasser: | |
---|---|
Beteiligte: | |
Format: | Dissertation |
Sprache: | Englisch |
Veröffentlicht: |
Philipps-Universität Marburg
2022
|
Schlagworte: | |
Online Zugang: | PDF-Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
No references were found for this record.