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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 412; číslo 50; s. 7018 - 7028
Hlavní autoři:	Adler, Isolde, Dorn, Frederic, Fomin, Fedor V., Sau, Ignasi, Thilikos, Dimitrios M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier B.V 25.11.2011 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!