Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2

DOI10.1007/978-3-319-68705-6_21zbMath1421.68081OpenAlexW2603409637MaRDI QIDQ5915796

Petr A. Golovach, Daniël Paulusma, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima

Publication date: 4 January 2018

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/22271/1/22271.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Finding cactus roots in polynomial time ⋮ Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2

This page was built for publication: Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2