The Complexity Of An Algotithm For Plane Dual Of A Plane Graph
- Authors
-
-
Dumitru Dan Burdescu
University of Craiova, Faculty of Automation, Computers and Electronics
-
- Abstract
- The paper presents an algorithm for construction of a plane dual of a plane graph and its complexity. The dual graph is used in planar graph theory and planar separator. Many other algorithms of planar graphs may be based on this proposed algorithm. The treatment has a more combinatorial aspect than the classical treatment.
- References
- Published
- 2001-06-30
- Issue
- Vol. 3 No. 2 (2001)
- Section
- Articles