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

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 412; no. 50; pp. 7018 - 7028
Main Authors:	Adler, Isolde, Dorn, Frederic, Fomin, Fedor V., Sau, Ignasi, Thilikos, Dimitrios M.
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 25.11.2011 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!