Note on Hopcroft and Tarjan's Planarity Algorithm

DOI10.1145/321921.321929MaRDI QIDQ4076761zbMATH OpenOpenAlexFDO

Authors Narsingh Deo

Publication date 1976

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321921.321929

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(3)

• An algorithm for imbedding cubic graphs in the torus
• Orthogonal drawings of graphs for the automation of VLSI circuit design
• Errors in graph embedding algorithms

This page was built for publication: Note on Hopcroft and Tarjan's Planarity Algorithm

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