Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. D. Avis and D. Rappaport, ‘Computing the largest empty convex subset of a set of points', Proceedings of the first ACM symposium on computational geometry, pp. 161–167, 1985.
2. M.A. Buckinghan, ‘Circle graphs', Ph.D. Dissertation, Report no. NSO-21, Courant Institute of Mathematical Sciences, 1980.
3. Hossam A. ElGindy, ‘Hierarchical decomposition of polygons with applications', Ph.D. Dissertation, McGill University, April 1985.
4. F. Gavril, ‘Algorithms for minimum colouring, maximum clique, minimum convering by cliques, and maximum independent set of a chordal graph', SIAM Journal on Computing, vol. 1, no.2, pp. 180–187, 1972.
5. M.C. Golumbic, ‘Algorithmic graph theory and perfect graphs', Academic Press, 1980.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献