Simpler algorithms for testing two-page book embedding of partitioned graphs
From MaRDI portal
Recommendations
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Implementing a partitioned 2-page book embedding testing algorithm
- Two-page book embedding of trees under vertex-neighborhood constraints
- A trade-off between page number and page width of book embeddings of graphs
- scientific article; zbMATH DE number 4049089
- Two-page book embeddings of 4-planar graphs
- Two-page book embeddings of 4-planar graphs
- Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
- Optimum embedding of complete graphs in books
- Parameterized algorithms for book embedding problems
Cites work
- scientific article; zbMATH DE number 1262793 (Why is no real title available?)
- scientific article; zbMATH DE number 1974122 (Why is no real title available?)
- scientific article; zbMATH DE number 2080088 (Why is no real title available?)
- A new perspective on clustered planarity as a combinatorial embedding problem
- A new planarity test
- Advancements on SEFE and partitioned book embedding problems
- Clustering Cycles into Cycles of Clusters
- Completely connected clustered graphs
- Efficient Planarity Testing
- Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
- Embedding planar graphs in four pages
- Implementing a partitioned 2-page book embedding testing algorithm
- On-line maintenance of triconnected components with SPQR-trees
- Planarity for clustered graphs
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- The book thickness of a graph
- Toward a theory of planarity: Hanani-Tutte and planarity variants
Cited in
(10)- Simpler algorithms for testing two-page book embedding of partitioned graphs
- On 3-coloring circle graphs
- Implementing a partitioned 2-page book embedding testing algorithm
- Beyond Clustered Planar Graphs
- Two-page book embedding of trees under vertex-neighborhood constraints
- Upward book embeddings of st-graphs
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- On 3-coloring circle graphs
- Upward partitioned book embeddings
This page was built for publication: Simpler algorithms for testing two-page book embedding of partitioned graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748996)
