The two basic linear time Planarity algorithms: Are they the same?

DOI10.1080/03081089008817982MaRDI QIDQ5749306zbMATH OpenOpenAlexFDO

Authors E. Rodney Canfield, S. Gill Williamson

Publication date 1990

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081089008817982

zbMATH Keywords

Hopcroft-Tarjan algorithmLempel-Even- Cederbaum algorithmplanarity testing algorithms

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Bijective comparison of optimal planarity algorithms
• A new planarity test
• Isomorphism of planar graphs (working paper)
• A Planarity Test via Construction Sequences
• An efficient parallel algorithm for planarity

Cites work

• Computing an st-numbering
• Efficient Planarity Testing
• scientific article; zbMATH DE number 1792682 (Why is no real title available?)
• Ranking and unranking planar embeddings
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(6)

• The complexity of planarity testing
• Gap strings and spanning forests for bridge graphs of biconnected graphs
• scientific article; zbMATH DE number 4079189 (Why is no real title available?)
• A matrix analysis of carrier posets of biconnected graphs
• Canonical forms for cycles in bridge graphs
• Bijective comparison of optimal planarity algorithms

This page was built for publication: The two basic linear time Planarity algorithms: Are they the same?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5749306)