Note on Hopcroft and Tarjan's Planarity Algorithm
From MaRDI portal
Publication:4076761
DOI10.1145/321921.321929zbMath0315.68033OpenAlexW1969896282MaRDI QIDQ4076761
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
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
An algorithm for imbedding cubic graphs in the torus ⋮ Errors in graph embedding algorithms ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design
