RO  EN
IMI/Publicaţii/CSJM/Ediţii/CSJM v.15, n.3 (45), 2007/

An algorithm of graph planarity testing and cross minimization

Authors: Vitalie Cotelea, Stela Pripa

Abstract

This paper presents an overview on one compartment from the graph theory, called graph planarity testing. It covers the fundamental concepts and important work in this area. Also a new approach is presented, which tests if a graph is planar in linear time O(n) and it can be used to determine the minimum crosses in a graph if it isn't planar.

Vitalie Cotelea, Stela Pripa
Vitalie Cotelea
Academy of Economic Studies of Moldova
Phone: (+373 22) 40 28 87
E-mail:
Stela Pripa
Academy of Economic Studies of Moldova
Phone: (+373 22) 72 71 24
E-mail:

Fulltext

Adobe PDF document0.15 Mb