Bijective comparison of optimal planarity algorithms
From MaRDI portal
Publication:4838131
DOI10.1080/03081089508818361zbMath0826.68091OpenAlexW2036322986WikidataQ114100503 ScholiaQ114100503MaRDI QIDQ4838131
Publication date: 20 November 1995
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081089508818361
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Ranking and unranking planar embeddings
- Embedding Graphs in the Plane—Algorithmic Aspects
- Efficient Planarity Testing
- Depth-First Search and Linear Graph Algorithms
- The two basic linear time Planarity algorithms: Are they the same?