Faster parameterized algorithms for minor containment

The H - Minor containment problem asks whether a graph G contains some fixed graph H as a minor, that is, whether H can be obtained by some subgraph of G after contracting edges. The derivation of a polynomial-time algorithm for H - Minor containment is one of the most important and technical parts...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 412; H. 50; S. 7018 - 7028
Hauptverfasser:	Adler, Isolde, Dorn, Frederic, Fomin, Fedor V., Sau, Ignasi, Thilikos, Dimitrios M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Elsevier B.V 25.11.2011 Elsevier
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Branchwidth Combinatorial analysis Combinatorics Combinatorics. Ordered structures Computer Science Computer science; control theory; systems Containment Derivation Discrete Mathematics Dynamic programming Exact sciences and technology Graph minor containment Graph minors Graph theory Graphs Graphs on surfaces Information retrieval. Graph Ingredients Mathematical models Mathematics Miscellaneous Networks Parameterized complexity Sciences and techniques of general use Theoretical computing Dynamic programming Branchwidth Graph minor containment Graph minors Parameterized complexity Graphs on surfaces Modification Edge(graph) Computer theory Decomposition method Algorithmics Graph theory Contraction Complexity Surface Polynomial time Packing Subgraph
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!