Clustered planarity testing revisited
From MaRDI portal
Publication:895058
zbMath1327.05076MaRDI QIDQ895058
Dömötör Pálvölgyi, Radoslav Fulek, Igor Malinović, Jan Kynčl
Publication date: 26 November 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p24
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Linear equations (linear algebraic aspects) (15A06)
Related Items
Hanani--Tutte and Hierarchical Partial Planarity, Atomic Embeddability, Clustered Planarity, and Thickenability, Unified Hanani-Tutte theorem, Synchronized Planarity with Applications to Constrained Planarity Problems, \(c\)-planarity of embedded cyclic \(c\)-graphs, A Direct Proof of the Strong Hanani–Tutte Theorem on the Projective Plane, Hanani-Tutte for Radial Planarity II, Embeddings of \(k\)-complexes into \(2k\)-manifolds, Embedding graphs into embedded graphs, Clustered planarity = flat clustered planarity, Stability of intersections of graphs in the plane and the van Kampen obstruction, C-planarity testing of embedded clustered graphs with bounded dual carving-width, Simultaneous Embedding, Embedding Graphs into Embedded Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithmic study of switch graphs
- Removing even crossings
- Removing even crossings on surfaces
- A characterization of planar graphs by Trémaux orders
- Which crossing number is it anyway?
- Bounds for generalized thrackles
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Upward Planarity Testing: A Computational Study
- Strip Planarity Testing
- Clustered Planarity Testing Revisited
- Towards the Hanani-Tutte Theorem for Clustered Graphs
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Powers of tensors and fast matrix multiplication
- Strong Hanani–Tutte on the Projective Plane
- Towards an implementation of the 3D visibility skeleton
- Solving sparse linear equations over finite fields
- Improved Bounds for Matroid Partition and Intersection Algorithms
- A generalization of the fast LUP matrix decomposition algorithm and applications
- Efficient Planarity Testing
- Matroid intersection algorithms
- Hierarchical planarity testing algorithms
- Practical Experience with Hanani-Tutte for Testing c-Planarity
- Hanani-Tutte and Related Results
- Clustering Cycles into Cycles of Clusters
- C-Planarity of C-Connected Clustered Graphs
- Multiplying matrices faster than coppersmith-winograd
- TRÉMAUX TREES AND PLANARITY
- Toward a theory of crossing numbers
- Planarity for clustered graphs
