On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- A Depth-First-Search Characterization of Planarity
- A linear algorithm for embedding planar graphs using PQ-trees
- Computing an st-numbering
- Depth-First Search and Kuratowski Subgraphs
- Efficient Planarity Testing
- How to draw a planar graph on a grid
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Cited in
(10)- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- An annotated review on graph drawing and its applications
- A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs
- A new planarity test
- Practical Experience with Hanani-Tutte for Testing c-Planarity
- Using Brouwer’s Fixed Point Theorem
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- Graphs with no \(K_{3,3}\) minor containing a fixed edge
This page was built for publication: On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920431)
