Finding k Disjoint Triangles in an Arbitrary Graph

We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H=K3 (the triangle) we give an O(22klog k + 1.869kn2) algorithm, and for general H an O(2k|H|logk + 2k|H|log |H|n|H|) algorithm. We introduce a preprocessing (ker...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Fellows, Mike, Heggernes, Pinar, Rosamond, Frances, Sloper, Christian, Telle, Jan Arne
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Arbitrary Graph Computer science control theory systems Exact Algorithm Exact sciences and technology Information retrieval. Graph Input Graph Reduction Rule Search Tree Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!