Author:
Somkunwar Rachna,Vaze Vinod M.
Reference25 articles.
1. Colbourn, C.J.: On testing isomorphism of permutation graphs. Networks 11, 13–21 (1981)
2. Lueker, G.S., Booth, K.S.: A linear time algorithm for deciding interval graph isomorphism. J. ACM 183–195 (1979)
3. Garey, M.R. Johnson, D.S.: Computers and Intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company (1979)
4. Damaschke, P.: Induced subgraph isomorphism for cographs is NP-complete. In: WG’90. Lecture Notes in Comput. Sciences, vol. 487, pp. 72–78 (1991)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: a guide to the theory of NP-Completeness. Freeman (1979)