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

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Yazar: Sommer, Frank
Diğer Yazarlar: Komusiewicz, Christian (Prof. Dr.) (Tez danışmanı)
Materyal Türü: Dissertation
Dil:İngilizce
Baskı/Yayın Bilgisi: Philipps-Universität Marburg 2022
Konular:
Algorithmik
Algorithmics
Parameterized Complexity
Mathematik
Graph algorithms
Analysis of social networks
Parametrisierte Komplexität, Graph Algorithmen, Analyse sozialer Netzwerke
Mathematics
Online Erişim:PDF Tam Metin
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
No references were found for this record.

Benzer Materyaller