Affiliation:
1. Princeton Univ., Princeton, NJ
2. Northwestern Univ., Evanston, IL
Abstract
The main result of this paper is an
0
([
V
] x [
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
0
([
V
] x [
E
]) time a decomposition of a graph into prime graphs, thereby improving on a result of Cunningham.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference19 articles.
1. Distance-hereditary graphs
2. Digraph Decompositions and Eulerian Systems
3. Reducing prime graphs and recognizing circle graphs
4. BUCKINGHAM M.A. Circle graphs. Courant Computer Science Rep. No. 21 Ph.D. dissertation. Courant Inst. of Math. Sciences Computer Science Dept. New York Univ. New York N.Y. Oct. 1980. BUCKINGHAM M.A. Circle graphs. Courant Computer Science Rep. No. 21 Ph.D. dissertation. Courant Inst. of Math. Sciences Computer Science Dept. New York Univ. New York N.Y. Oct. 1980.
5. Decomposition of directed graphs. SlAM d;CUNNINGHAM W. H;Algor. Discrete Meth.,1982
Cited by
66 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献