An algorithm of graph planarity testing and cross minimization

An algorithm of graph planarity testing and cross minimization

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 min...

Full description

Bibliographic Details
Main Authors: Vitalie Cotelea, Stela Pripa
Format: Article
Language:English
Published: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova 2007-11-01
Series:Computer Science Journal of Moldova
Online Access:http://www.math.md/files/csjm/v15-n3/v15-n3-(pp278-287).pdf
id doaj-0eedb3182cb248548a1d61cf2fd8770f
record_format Article
spelling doaj-0eedb3182cb248548a1d61cf2fd8770f2020-11-25T02:25:40ZengInstitute of Mathematics and Computer Science of the Academy of Sciences of MoldovaComputer Science Journal of Moldova1561-40422007-11-01153(45)278287An algorithm of graph planarity testing and cross minimizationVitalie Cotelea0Stela Pripa1Academy of Economic Studies of MoldovaAcademy of Economic Studies of MoldovaThis 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.http://www.math.md/files/csjm/v15-n3/v15-n3-(pp278-287).pdf
collection DOAJ
language English
format Article
sources DOAJ
author Vitalie Cotelea
Stela Pripa
spellingShingle Vitalie Cotelea
Stela Pripa
An algorithm of graph planarity testing and cross minimization
Computer Science Journal of Moldova
author_facet Vitalie Cotelea
Stela Pripa
author_sort Vitalie Cotelea
title An algorithm of graph planarity testing and cross minimization
title_short An algorithm of graph planarity testing and cross minimization
title_full An algorithm of graph planarity testing and cross minimization
title_fullStr An algorithm of graph planarity testing and cross minimization
title_full_unstemmed An algorithm of graph planarity testing and cross minimization
title_sort algorithm of graph planarity testing and cross minimization
publisher Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
series Computer Science Journal of Moldova
issn 1561-4042
publishDate 2007-11-01
description 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.
url http://www.math.md/files/csjm/v15-n3/v15-n3-(pp278-287).pdf
work_keys_str_mv AT vitaliecotelea analgorithmofgraphplanaritytestingandcrossminimization
AT stelapripa analgorithmofgraphplanaritytestingandcrossminimization
AT vitaliecotelea algorithmofgraphplanaritytestingandcrossminimization
AT stelapripa algorithmofgraphplanaritytestingandcrossminimization
_version_ 1724850712817434624

Similar Items