Beyond Clustered Planar Graphs
From MaRDI portal
Publication:5001664
DOI10.1007/978-981-15-6533-5_12OpenAlexW3089399698MaRDI QIDQ5001664
Patrizio Angelini, Giordano Da Lozzo
Publication date: 22 July 2021
Published in: Beyond Planar Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-15-6533-5_12
Related Items (5)
A user study on hybrid graph visualizations ⋮ \((k,p)\)-planarity: a relaxation of hybrid planarity ⋮ k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ The Computational Complexity of the ChordLink Model ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending convex partial drawings of graphs
- Strip planarity testing for embedded planar graphs
- The partial visibility representation extension problem
- On simultaneous planar graph embeddings
- A new perspective on clustered planarity as a combinatorial embedding problem
- On embedding a cycle in a plane graph
- Subexponential-time and FPT algorithms for embedded flat clustered planarity
- \(c\)-planarity of embedded cyclic \(c\)-graphs
- Clustered planarity = flat clustered planarity
- Turning cliques into paths to achieve planarity
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- A Kuratowski-type theorem for planarity of partially embedded graphs
- Simultaneous FPQ-ordering and hybrid planarity testing
- Relaxing the constraints of clustered planarity
- NodeTrix planarity testing with small clusters
- Advancements on SEFE and partitioned book embedding problems
- Clustered planarity with pipes
- Completely connected clustered graphs
- Bounded Embeddings of Graphs in the Plane
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Clustered Planarity Testing Revisited
- Computing NodeTrix Representations of Clustered Graphs
- Crossing Number is NP-Complete
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
- Clustered Planarity: Clusters with Few Outgoing Edges
- Computing Maximum C-Planar Subgraphs
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Partial and Constrained Level Planarity
- Hierarchical planarity testing algorithms
- Shrinking the Search Space for Clustered Planarity
- Testing Planarity of Partially Embedded Graphs
- Recognizing Weak Embeddings of Graphs
- Computing k-modal embeddings of planar digraphs
- Hanani-Tutte for approximating maps of graphs
- Embedding Graphs into Embedded Graphs
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Practical Experience with Hanani-Tutte for Testing c-Planarity
- Simultaneous Embedding of Planar Graphs with Few Bends
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- C-Planarity of C-Connected Clustered Graphs
- Intersection-Link Representations of Graphs
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
- Simultaneous Embedding with Two Bends per Edge in Polynomial Area
- C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.
- Graph Drawing
- Planarity for clustered graphs
This page was built for publication: Beyond Clustered Planar Graphs
