Title :
An optimal algorithm for finding maximum induced bipartite subgraphs of circular-arc graphs
Author_Institution :
Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
Abstract :
Given an intersection model S, which is a family of n arcs around a circle, of a circular-arc graph G, this algorithm requires O(n logn) time and O(n) space, if the endpoints of arcs are not sorted, and O(n) time is sufficient, if the endpoints of arcs are sorted
Keywords :
computational complexity; graph theory; circular-arc graphs; maximum induced bipartite subgraphs; optimal algorithm; space complexity; time complexity; Computer science;
Conference_Titel :
Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on
Conference_Location :
Toronto, Ont.
Print_ISBN :
0-8186-2812-X
DOI :
10.1109/ICCI.1992.227707
