Upward Partitioned Book Embeddings

DOI10.1007/978-3-319-73915-1_18zbMath1503.68200arXiv1708.06730OpenAlexW2746376681MaRDI QIDQ4625113

Adam Hesterberg, Erik D. Demaine, Quanquan C. Liu, Hugo A. Akitaya

Publication date: 20 February 2019

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

Full work available at URL: https://arxiv.org/abs/1708.06730

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Matching book thickness of generalized Petersen graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ Upward Partitioned Book Embeddings ⋮ Upward Book Embeddings of st-Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-page book embeddings of 4-planar graphs
• Embedding planar graphs in four pages
• On the pagenumber of complete bipartite graphs
• When can you fold a map?
• PassGAN: a deep learning approach for password guessing
• Advancements on SEFE and partitioned book embedding problems
• The book thickness of 1-planar graphs is constant
• Book embeddability of series-parallel digraphs
• Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
• Oriented Book Embeddings
• On the Page Number of Upward Planar Directed Acyclic Graphs
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Total Ordering Problem
• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Stack and Queue Layouts of Posets
• Upward Partitioned Book Embeddings
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Implementing a Partitioned 2-Page Book Embedding Testing Algorithm