Simpler algorithms for testing two-page book embedding of partitioned graphs

DOI10.1016/j.tcs.2015.12.039zbMath1390.68502OpenAlexW3023671586MaRDI QIDQ1748996

Hiroshi Nagamochi, Seok-Hee Hong

Publication date: 15 May 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.039

zbMATH Keywords

book embeddingplanar graphclustered planarity2-page book embedding

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Upward book embeddability of \(st\)-graphs: complexity and algorithms, Upward Book Embeddings of st-Graphs, Beyond Clustered Planar Graphs, Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• Embedding planar graphs in four pages
• The book thickness of a graph
• On-line maintenance of triconnected components with SPQR-trees
• A new planarity test
• Advancements on SEFE and partitioned book embedding problems
• Completely connected clustered graphs
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
• Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
• A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• Efficient Planarity Testing
• Implementing a Partitioned 2-Page Book Embedding Testing Algorithm
• Clustering Cycles into Cycles of Clusters
• Planarity for clustered graphs