Clustered planarity with pipes
From MaRDI portal
Publication:2414866
DOI10.1007/s00453-018-00541-wzbMath1421.68103OpenAlexW2914018949WikidataQ62046540 ScholiaQ62046540MaRDI QIDQ2414866
Giordano Da Lozzo, Patrizio Angelini
Publication date: 17 May 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6781/
fixed parameter tractabilitygraph drawingclustered planaritysimultaneous embeddings with fixed edges
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ Synchronized Planarity with Applications to Constrained Planarity Problems ⋮ Embedding graphs into embedded graphs ⋮ Crossing minimization in perturbed drawings ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Beyond Clustered Planar Graphs ⋮ Simultaneous Embedding
Cites Work
- Unnamed Item
- Unnamed Item
- Strip planarity testing for embedded planar graphs
- A new perspective on clustered planarity as a combinatorial embedding problem
- On embedding a cycle in a plane graph
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- PC trees and circular-ones arrangements.
- Subexponential-time and FPT algorithms for embedded flat clustered planarity
- \(c\)-planarity of embedded cyclic \(c\)-graphs
- Advancements on SEFE and partitioned book embedding problems
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Towards the Hanani-Tutte Theorem for Clustered Graphs
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Clustered Planarity with Pipes
- Shrinking the Search Space for Clustered Planarity
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- Hanani-Tutte for approximating maps of graphs
- Clustering Cycles into Cycles of Clusters
- C-Planarity of C-Connected Clustered Graphs
- Detecting Weakly Simple Polygons
- Planarity for clustered graphs
This page was built for publication: Clustered planarity with pipes