A left-first search algorithm for planar graphs
From MaRDI portal
Publication:1892422
DOI10.1007/BF02574056zbMATH Open0826.68090OpenAlexW1989142182MaRDI QIDQ1892422FDOQ1892422
Hubert de Fraysseix, P. Ossona de Mendez, János Pach
Publication date: 2 July 1995
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131374
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two trees in maximal planar bipartite graphs
- How to draw a planar graph on a grid
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Bipartite graphs, upward drawings, and planarity
- On grid intersection graphs
- Intersection graphs of curves in the plane
- Computing an st-numbering
- Light sources, obstructions and spherical orders
- Bipolar orientations revisited
- Planar lattices and planar graphs
- st-ordering the vertices of biconnected graphs
- On the Classification of Graphs
Cited In (24)
- Planar 3-SAT with a clause/variable cycle
- Bijections for Baxter families and related objects
- Title not available (Why is that?)
- On Mixed Linear Layouts of Series-Parallel Graphs
- On the number of rectangulations of a planar point set
- Drawings of planar graphs with few slopes and segments
- Mixed linear layouts: complexity, heuristics, and experiments
- 4-labelings and grid embeddings of plane quadrangulations
- Planar bus graphs
- Vertex Contact Graphs of Paths on a Grid
- On Representation of Planar Graphs by Segments
- Crossing patterns of segments
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
- The Rique-number of graphs
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- On dispersable book embeddings
- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
- Orthogonal segment stabbing
- Recognizing DAGs with page-number 2 is NP-complete
- On partitioning the edges of 1-plane graphs
- Extension of a theorem of Whitney
- Recognizing DAGs with page-number 2 is NP-complete
- On mixed linear layouts of series-parallel graphs
- Depth-First Search in Directed Planar Graphs, Revisited
Recommendations
This page was built for publication: A left-first search algorithm for planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892422)
