Clustered planarity testing revisited
zbMATH Open1327.05076MaRDI QIDQ895058FDOQ895058
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Graph theory (including graph drawing) in computer science (68R10) Linear equations (linear algebraic aspects) (15A06) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Powers of tensors and fast matrix multiplication
- Improved Bounds for Matroid Partition and Intersection Algorithms
- Efficient Planarity Testing
- Multiplying matrices faster than coppersmith-winograd
- Solving sparse linear equations over finite fields
- Towards an implementation of the 3D visibility skeleton
- Matroid intersection algorithms
- A generalization of the fast LUP matrix decomposition algorithm and applications
- Hierarchical planarity testing algorithms
- An algorithmic study of switch graphs
- Toward a theory of planarity: Hanani-Tutte and planarity variants
- Towards the Hanani-Tutte Theorem for Clustered Graphs
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Clustering Cycles into Cycles of Clusters
- Planarity for clustered graphs
- Which crossing number is it anyway?
- Toward a theory of crossing numbers
- Removing even crossings
- Bounds for generalized thrackles
- TRÉMAUX TREES AND PLANARITY
- Removing even crossings on surfaces
- C-Planarity of C-Connected Clustered Graphs
- A characterization of planar graphs by Trémaux orders
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Upward Planarity Testing: A Computational Study
- Strip Planarity Testing
- Clustered Planarity Testing Revisited
- Strong Hanani–Tutte on the Projective Plane
- Practical Experience with Hanani-Tutte for Testing c-Planarity
- Hanani-Tutte and Related Results
Cited In (16)
- Clustered planarity = flat clustered planarity
- A Direct Proof of the Strong Hanani–Tutte Theorem on the Projective Plane
- Hanani--Tutte and Hierarchical Partial Planarity
- NodeTrix planarity testing with small clusters
- Embedding Graphs into Embedded Graphs
- Hanani-Tutte for Radial Planarity II
- Synchronized Planarity with Applications to Constrained Planarity Problems
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- \(c\)-planarity of embedded cyclic \(c\)-graphs
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Embeddings of \(k\)-complexes into \(2k\)-manifolds
- Embedding graphs into embedded graphs
- Unified Hanani-Tutte theorem
- Simultaneous Embedding
- Stability of intersections of graphs in the plane and the van Kampen obstruction
- Hanani-Tutte for approximating maps of graphs
This page was built for publication: Clustered planarity testing revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895058)
