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

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 276 - 285
Main Authors:	Bressan, Marco, Roth, Marc
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.02.2022
Subjects:	Approximation algorithms Complexity theory Computer science counting problems degenerate graphs fine-grained complexity theory parameterized algorithms Pattern matching
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!