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...
| Main Authors: | , |
|---|---|
| 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 |