Pages that link to "Item:Q1920431"
From MaRDI portal
The following pages link to On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm (Q1920431):
Displayed 8 items.
- A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243) (← links)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- Graphs with no \(K_{3,3}\) minor containing a fixed edge (Q1953665) (← links)
- A new planarity test (Q1960413) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- Using Brouwer’s Fixed Point Theorem (Q4604376) (← links)
- An annotated review on graph drawing and its applications (Q6152611) (← links)