Induced Cycles and Paths Are Harder Than You Think

The goal of the paper is to give fine-grained hardness results for the Subgraph Isomorphism (SI) problem for fixed size induced patterns $H$, based on the $k$-Clique hypothesis that the current best algorithms for Clique are optimal. Our first main result is that for any pattern graph $H$ that is a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Dalirrooyfard, Mina, Williams, Virginia Vassilevska
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!