Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies

We study the problems of counting the homomorphisms, the copies, and the induced copies of a k -vertex graph H in a d -degenerate n -vertex graph G . By leveraging a new family of graph-minor obstructions called F-gadgets, we establish explicit and exhaustive complexity classifications for counting...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings / annual Symposium on Foundations of Computer Science S. 276 - 285
Hauptverfasser:	Bressan, Marco, Roth, Marc
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.02.2022
Schlagworte:	Approximation algorithms Complexity theory Computer science counting problems degenerate graphs fine-grained complexity theory parameterized algorithms Pattern matching
ISSN:	2575-8454
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!