C-planarity testing of embedded clustered graphs with bounded dual carving-width
From MaRDI portal
Publication:2041980
DOI10.1007/s00453-021-00839-2OpenAlexW3170034319MaRDI QIDQ2041980
Michael T. Goodrich, Giordano Da Lozzo, David Eppstein, Siddharth Gupta
Publication date: 26 July 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.02057
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Path-based supports for hypergraphs
- Strip planarity testing for embedded planar graphs
- Straight-line rectangular drawings of clustered graphs
- Drawing \(c\)-planar biconnected clustered graphs
- Clustered planarity testing revisited
- A new perspective on clustered planarity as a combinatorial embedding problem
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- On embedding a cycle in a plane graph
- Graph minors. X: Obstructions to tree-decomposition
- Call routing and the ratcatcher
- Subexponential-time and FPT algorithms for embedded flat clustered planarity
- Clustered planarity = flat clustered planarity
- Relaxing the constraints of clustered planarity
- Handle-rewriting hypergraph grammars
- Clustered planarity with pipes
- Completely connected clustered graphs
- Approximating clique-width and branch-width
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
- Fibonacci and Catalan Numbers
- Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
- Simultaneous Embeddability of Two Partitions
- The Importance of Being Proper
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
- Clustered Planarity Testing Revisited
- Twins in Subdivision Drawings of Hypergraphs
- Computing NodeTrix Representations of Clustered Graphs
- Blocks of Hypergraphs
- On the Boolean-Width of a Graph: Structure and Applications
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
- Treewidth of planar graphs: connections with duality
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- Subdivision Drawings of Hypergraphs
- An Almost Linear-Time Algorithm for Graph Realization
- Hypergraph planarity and the complexity of drawing venn diagrams
- Shrinking the Search Space for Clustered Planarity
- Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
- Beyond Clustered Planar Graphs
- Hanani-Tutte for approximating maps of graphs
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Practical Experience with Hanani-Tutte for Testing c-Planarity
- C-Planarity of C-Connected Clustered Graphs
- Overlapping Cluster Planarity
- Intersection-Link Representations of Graphs
- Planarity of Overlapping Clusterings Including Unions of Two Partitions
- Dynamic programming for graphs on surfaces
- C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.
- On Planar Supports for Hypergraphs
- Graph Drawing
- Graph Drawing
- SOFSEM 2004: Theory and Practice of Computer Science
- Planarity for clustered graphs
This page was built for publication: C-planarity testing of embedded clustered graphs with bounded dual carving-width
