Maximal Planarization of Non - Planar Graphs
Abstract This paper presents a MAXIMAL - PLANARIZE algorithm using EQUIVELANT - GRAPH procedure . The algorithm proceeds by embedding one or few edges at each stage , without creating nonplanarity of the resultant graph , and to construct a maximal planar subgraph G , of G directly . The present imp...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Unviversity of Technology- Iraq
2005-06-01
|
| Series: | Engineering and Technology Journal |
| Subjects: | |
| Online Access: | https://etj.uotechnology.edu.iq/article_182141_b3338db9e790682d3a8f812082b5bcd6.pdf |