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:
Hovedforfatter: | |
---|---|
Andre forfattere: | |
Format: | Dissertation |
Sprog: | engelsk |
Udgivet: |
Philipps-Universität Marburg
2022
|
Fag: | |
Online adgang: | PDF-Volltext |
Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
Vær først til at give en kommentarø!