Efficient deterministic algorithms for embedding graphs on books

DOI10.1007/3-540-61332-3_149zbMath1529.68226OpenAlexW1515663280MaRDI QIDQ6184660

Farhad Shahrokhi, Weiping Shi

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_149

Mathematics Subject Classification ID

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)

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• Embedding planar graphs in four pages
• The book thickness of a graph
• Smallest-last ordering and clustering and graph coloring algorithms
• The pagenumber of genus g graphs is O( g )
• Graphs with E Edges Have Pagenumber O(√E)
• Genus g Graphs Have Pagenumber O(√g)
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• An inequality for the chromatic number of a graph