Fast Minor Testing in Planar Graphs
From MaRDI portal
Publication:3586454
DOI10.1007/978-3-642-15775-2_9zbMath1287.05141WikidataQ60488611 ScholiaQ60488611MaRDI QIDQ3586454
Fedor V. Fomin, Dimitrios M. Thilikos, Ignasi Sau, Isolde Adler, Frederic Dorn
Publication date: 6 September 2010
Published in: Algorithms – ESA 2010 (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00736769/file/ark__67375_HCB-M3SJ9JPF-N.pdf
68Q25: Analysis of algorithms and problem complexity
90C39: Dynamic programming
05C10: Planar graphs; geometric and topological aspects of graph theory
05C83: Graph minors
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
The Parameterized Complexity of Graph Cyclability, Faster parameterized algorithms for minor containment, Fast minor testing in planar graphs, Graph Minors and Parameterized Algorithm Design