Thumbnail
Access Restriction
Subscribed

Author Gabor, Csaba P. ♦ Supowit, Kenneth J. ♦ Hsu, Wen-Lian
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1989
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract The main result of this paper is an $\textit{0}([\textit{V}]$ x $[\textit{E}])$ time algorithm for deciding whether a given graph is a circle graph, that is, the intersection graph of a set of chords on a circle. The algorithm utilizes two new graph-theoretic results, regarding necessary induced subgraphs of graphs having neither articulation points nor similar pairs of vertices. Furthermore, as a substep of the algorithm, it is shown how to find in $\textit{0}([\textit{V}]$ x $[\textit{E}])$ time a decomposition of a graph into prime graphs, thereby improving on a result of Cunningham.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1989-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 36
Issue Number 3
Page Count 39
Starting Page 435
Ending Page 473


Open content in new tab

   Open content in new tab
Source: ACM Digital Library