An Improved Algorithm for Testing the Planarity of a Graph

DOI10.1109/T-C.1975.224179MaRDI QIDQ4051590zbMATH OpenOpenAlexFDO

Authors F. Rubin

Publication date 1975

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/t-c.1975.224179

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99)

Cited in

(4)

• An algorithm for imbedding cubic graphs in the torus
• Improved planarity algorithms
• Automatische Abbildung eines planaren Graphen in die Ebene mit beliebig vorgebbaren Örtern der Knotenbilder
• Orthogonal drawings of graphs for the automation of VLSI circuit design

This page was built for publication: An Improved Algorithm for Testing the Planarity of a Graph

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