Faster parameterized algorithms for minor containment

DOI10.1007/978-3-642-13731-0_31MaRDI QIDQ3569902zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos

Publication date 22 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13731-0_31

zbMATH Keywords

dynamic programminggraph minorsparameterized complexitygraphs on surfacesbranchwidth

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph minors (05C83)

Recommendations

• Faster parameterized algorithms for minor containment
• Fast minor testing in planar graphs
• Branch decompositions and minor containment
• Catalan structures and dynamic programming in \(H\)-minor-free graphs
• Fast minor testing in planar graphs

Cited in

(11)

• Dynamic programming for graphs on surfaces
• Fast minor testing in planar graphs
• Square roots of minor closed graph classes
• Fast minor testing in planar graphs
• Branch decompositions and minor containment
• Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
• Irrelevant vertices for the planar disjoint paths problem
• Faster parameterized algorithms for minor containment
• Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
• Square roots of minor closed graph classes
• Quickly deciding minor-closed parameters in general graphs

This page was built for publication: Faster parameterized algorithms for minor containment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569902)