Journal of the ACM Bibliography
Csaba P. Gabor, Kenneth J. Supowit, and Wen-Lian Hsu. Recognizing
circle graphs in polynomial time. Journal of the ACM,
36(3):435-473, July 1989.
[BibTeX entry]
Selected papers that cite this one
- E. S. Elmallah and L. K. Stewart. Polygon graph
recognition. Journal of Algorithms, 26(1):101-140,
January 1998.
- Martin Charles Golumbic, Haim Kaplan, and Ron Shamir. Graph sandwich
problems. Journal of Algorithms, 19(3):449-473,
November 1995.
- Martin Charles Golumbic and Ron Shamir. Complexity and algorithms for
reasoning about time: A graph-theoretic approach. Journal of
the ACM, 40(5):1108-1133, November 1993.
- Wen-Lian Hsu. O(M N) algorithms for
the recognition and isomorphism problems on circular-arc graphs.
SIAM Journal on Computing, 24(3):411-439, June 1995.
Shortcuts: