Author:
Köbler Johannes,Kuhnert Sebastian,Verbitsky Oleg
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335–379 (1976)
2. Chen, L.: Graph isomorphism and identification matrices: Parallel algorithms. Trans. Paral. Distrib. Syst. 7(3), 308–319 (1996)
3. Curtis, A.R., Lin, M.C., McConnell, R.M., Nussbaum, Y., Soulignac, F.J., Spinrad, J.P., Szwarcfiter, J.L.: Isomorphism of graph classes related to the circular-ones property. Discrete Math. Theor. Comp. Sci. 15(1), 157–182 (2013)
4. Gavril, F.: Algorithms on circular-arc graphs. Networks 4, 357–369 (1974)
5. Hsu, W.L.: O(m ·n) algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM J. Comput. 24(3), 411–439 (1995)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献