An algorithm of graph planarity testing and cross minimization

MaRDI QIDQ1049731zbMATH OpenFDO

Authors Vitalie Cotelea, Stela Pripa

Publication date 13 January 2010

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A new approach to the linearity of testing planarity of graphs
• A successful concept for measuring non-planarity of graphs: The crossing number.
• A linear time algorithm for finding maximal planar subgraphs
• Planarity testing and constructing the topological drawing of a plane graph (DFS)
• On the linearity of testing planarity of graphs

Cited in

(7)

• On the linearity of testing planarity of graphs
• A new approach to the linearity of testing planarity of graphs
• scientific article; zbMATH DE number 3646924 (Why is no real title available?)
• Orthogonal planarity testing of bounded treewidth graphs
• scientific article; zbMATH DE number 3871391 (Why is no real title available?)
• A linear time algorithm for finding maximal planar subgraphs
• An algorithm for an 𝓁²-homological test for the planarity of a graph

This page was built for publication: An algorithm of graph planarity testing and cross minimization

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