Advances on C-Planarity Testing of Extrovert C-Graphs
by
Jonathan Z. Sun
,
Chaoyang Zhang
BibTeX
@MISC{Sun_advanceson,
author = {Jonathan Z. Sun and Chaoyang Zhang},
title = {Advances on C-Planarity Testing of Extrovert C-Graphs},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract- The problem of testing c-planarity of c-graphs is unknown to be NP-complete or in P. Previous work solved this problem on some special classes of c-graphs. In particular, Goodrich, Lueker, and Sun tested c-planarity of extrovert c-graphs in O(n 3) time [5]. In this paper, we improve the time complexity of the testing algorithm in [5] to O(n) 2. Keywords:
Citations
| 406 | G.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-trees - Booth, Lueker - 1976 |
| 193 | Tarjan, Efficient planarity testing - Hopcroft, E - 1974 |
| 22 | PC-trees and circular-ones arrangements - Hsu, McConnell - 2003 |
| 13 | A linear time algorithm to recognize clustered planar graphs and its parallelization - Dahlhaus - 1998 |
| 11 | Advances in cplanarity testing of clustered graphs - GUTWENGER, JÜNGER, et al. - 2002 |
| 8 | Clustering cycles into cycles of clusters - Cortese, Battista, et al. - 2004 |
| 5 | Clustered graphs and C-planarity - Feng, Eades, et al. - 1995 |
| 5 | C-planarity of extrovert clustered graphs - Goodrich, Lueker, et al. - 2005 |
