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...
Furkejuvvon:
Váldodahkki: | |
---|---|
Eará dahkkit: | |
Materiálatiipa: | Dissertation |
Giella: | eaŋgalasgiella |
Almmustuhtton: |
Philipps-Universität Marburg
2022
|
Fáttát: | |
Liŋkkat: | PDF-ollesdeaksta |
Fáddágilkorat: |
Lasit fáddágilkoriid
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|
No references were found for this record.