Faster Parameterized Algorithms for Minor Containment

DOI10.1007/978-3-642-13731-0_31zbMath1285.68206OpenAlexW2123988662WikidataQ60488615 ScholiaQ60488615MaRDI QIDQ3569902

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

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 programmingparameterized complexitygraph minorsgraphs on surfacesbranchwidth

Mathematics Subject Classification ID

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

Related Items (7)

Irrelevant vertices for the planar disjoint paths problem ⋮ Square roots of minor closed graph classes ⋮ Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ Fast minor testing in planar graphs ⋮ Unnamed Item ⋮ Dynamic programming for graphs on surfaces

This page was built for publication: Faster Parameterized Algorithms for Minor Containment