Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
DOI10.1007/978-3-319-08783-2_41zbMath1425.05151OpenAlexW2222028930MaRDI QIDQ2920483
Hiroshi Nagamochi, Seok-Hee Hong
Publication date: 26 September 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_41
Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (9)
This page was built for publication: Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs