- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Maximal Planarization of Non - Planar Graphs | ||
| Engineering and Technology Journal | ||
| Volume 24, Issue 6, June 2005, Pages 734-749 PDF (1.56 M) | ||
| Document Type: Research Paper | ||
| DOI: 10.30684/etj.24.6.10 | ||
| Author | ||
| Suzan Khalil Yacob | ||
| Dept of Electrical Engineering, University of Technology, Baghdad-IRAQ. | ||
| Abstract | ||
| 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 implementation shows that using two planarization algorithms is unnecessary because of their complexities . It runs in linear time to give a maximal planar subgraph and adds the maximum number of edges possible without creating nonplanarity , using only one simple and efficient algorithm . | ||
| Keywords | ||
| Key words: Nonplanar graph; Hamiltonian circuit | ||
|
Statistics Article View: 98 PDF Download: 105 |
||