Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs

Given two graphs G and H as input, the Induced Subgraph Isomorphism (ISI) problem is to decide whether G has an induced subgraph that is isomorphic to H. This problem is NP-complete already when G and H are restricted to disjoint unions of paths, and consequently also NP-complete on proper interval...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2015, Vol.562, p.252-269
Hauptverfasser:	Heggernes, Pinar, van 't Hof, Pim, Meister, Daniel, Villanger, Yngve
Format:	Artikel
Sprache:	eng
Schlagworte:	Complement Fixed-parameter tractable Graph theory Graphs Induced subgraphs Intervals Isomorphism Permutations Polynomial-time Polynomials Unions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!