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:
主要作者: | |
---|---|
其他作者: | |
格式: | Dissertation |
語言: | 英语 |
出版: |
Philipps-Universität Marburg
2022
|
主題: | |
在線閱讀: | PDF-Volltext |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!