Author:
Mandal Swagata,Pal Madhumangal
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference13 articles.
1. A. A. Bertossi and S. Moretti,Parallel algorithms on circular-arc graphs, Information Processing Letters33 (1989/1990), 175–281.
2. M. R. Garey and D. S. Johnson,Computer and Intractability: A Guide to the Theory of NP-Completeness (Freeman San Francisco, CA, 1979).
3. F. Gavril,Algorithms on circular-arc graphs, Networks4 (1974), 357–369.
4. M. C. Golumbic,Algorithm Graph Theory and Perfect Graphs, (Academic Press, New York, 1980).
5. M. C. Golumbic and P. L. Hammer,Stability in circular-arc graphs, Journal of Algorithms9 (1988), 314–320.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献