Fast minor testing in planar graphs
From MaRDI portal
Publication:1759679
DOI10.1007/s00453-011-9563-9zbMath1254.05185WikidataQ56235104 ScholiaQ56235104MaRDI QIDQ1759679
Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos, Isolde Adler, Frederic Dorn
Publication date: 21 November 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00904515/file/Minor-planar.pdf
algorithm; dynamic programming; planar graphs; model; parameterized complexity; graph minors; branchwidth; minor containment problem
90C39: Dynamic programming
05C10: Planar graphs; geometric and topological aspects of graph theory
05C83: Graph minors
05C85: Graph algorithms (graph-theoretic aspects)