Advancements on SEFE and partitioned book embedding problems
From MaRDI portal
Publication:2339452
DOI10.1016/j.tcs.2014.11.016zbMath1309.68078arXiv1311.3607OpenAlexW2964295405WikidataQ62046546 ScholiaQ62046546MaRDI QIDQ2339452
Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth
Publication date: 1 April 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.3607
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (20)
A survey on book-embedding of planar graphs ⋮ Clustered planarity with pipes ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ On the complexity of the storyplan problem ⋮ On the complexity of the storyplan problem ⋮ Small Point-Sets Supporting Graph Stories ⋮ Computing NodeTrix Representations of Clustered Graphs ⋮ Simultaneous Orthogonal Planarity ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ The QuaSEFE problem ⋮ Upward Partitioned Book Embeddings ⋮ Simpler algorithms for testing two-page book embedding of partitioned graphs ⋮ Hierarchical partial planarity ⋮ The importance of being proper ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Upward Book Embeddings of st-Graphs ⋮ Beyond Clustered Planar Graphs ⋮ Simultaneous Embedding ⋮ Planarity of streamed graphs
Cites Work
- Unnamed Item
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Simultaneous embedding: edge orderings, relative positions, cutvertices
- Relaxing the constraints of clustered planarity
- 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
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- Noncrossing Subgraphs in Topological Layouts
- Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
- SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS
- Simultaneous Graph Embeddings with Fixed Edges
- Total Ordering Problem
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Disconnectivity and Relative Positions in Simultaneous Embeddings
- Testing Simultaneous Planarity when the Common Graph is 2-Connected
- Testing Planarity of Partially Embedded Graphs
- Simultaneous Embedding of Planar Graphs with Few Bends
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- On Some $\mathcal{NP}$ -complete SEFE Problems
- Embedding planar graphs at fixed vertex locations
- Planarity for clustered graphs
This page was built for publication: Advancements on SEFE and partitioned book embedding problems
