The book embedding problem from a SAT-solving perspective

DOI10.1007/978-3-319-27261-0_11MaRDI QIDQ2959749zbMATH OpenOpenAlexFDO

Authors Michael A. Bekos, Michael Kaufmann, Christian Zielke

Publication date 10 February 2017

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-27261-0_11

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Computational aspects of satisfiability (68R07) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A survey on book-embedding of planar graphs
• A survey on book-embedding of planar graphs
• Embedding planar graphs in four pages

Cited in

(17)

• A survey on book-embedding of planar graphs
• The mixed page number of graphs
• Embedding planar 5-graphs in three pages
• Planar graphs that need four pages
• An annotated bibliography on 1-planarity
• A satisfiability formulation of problems on level graphs
• Mixed linear layouts of planar graphs
• Computing storyline visualizations with few block crossings
• A survey on book-embedding of planar graphs
• On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
• The Rique-number of graphs
• Splitting plane graphs to outerplanarity
• On the pagenumber of 1-planar graphs
• The page number of monotone directed acyclic outerplanar graphs is four or five
• OOPS: optimized one-planarity solver via SAT
• A walk on the wild side: a shape-first methodology for orthogonal drawings
• OOPS: optimized one-planarity solver via SAT

This page was built for publication: The book embedding problem from a SAT-solving perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959749)