Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

Discrete Applied Mathematics

Volumn 145, Issue 3, 2005, Pages 479-482

  Uehara, Ryuhei ^a   Toda, Seinosuke ^b   Nagoya, Takayuki ^c  

^a KOMAZAWA UNIVERSITY   (Japan)

^b NIHON UNIVERSITY   (Japan)

^c TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

Chordal bipartite graphs; Graph isomorphism complete; Graph isomorphism problem; Strongly chordal graphs

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; POLYNOMIAL APPROXIMATION; PROBABILITY; PROBLEM SOLVING;

CHORDAL BIPARTITE GRAPHS; GRAPH ISOMORPHISM COMPLETE; GRAPH ISOMORPHISM PROBLEM; STRONGLY CHORDAL GRAPHS;

GRAPH THEORY;

EID: 9344256091     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.06.008     Document Type: Article

References (13)

1. V. Arvind, P.P. Kurur, Graph isomorphism is in SPP, in: Proceedings of the 43rd Symposium on Foundations of Computer Science,2002, pp. 743-750.
2. L. Babel, I.N. Ponomarenko, G. Tinhofer, The isomorphism problem for directed path graphs and for rooted directed path graphs, J. Algorithms 21 (1996) 542-564.
3. K.S. Booth, C.J. Colbourn, Problems polynomially equivalent to graph isomorphism, Technical Report CS-77-04, Computer Science Department, University of Waterloo, 1979.
4. A. Brandstädt, V.B. Le, J.P. Spinrad, Graph classes: a survey, SIAM, 1999.
5. L. Chen, Graph isomorphism and identification matrices: sequential algorithms, J. Comput. Syst. Sci. 59 (1999) 450-475.
6. P. Hell, J. Huang, Interval bigraphs and circular arc graphs, J. Graph Theory, 46 (2004) 313-327.
7. W.L. Hsu, O(M · N), Algorithms for the recognition and isomorphism problem on circular-arc graphs, SIAM J. Comput. 24 (1995) 411-439.
8. R.M. Karp, Complexity of computer computations, Reducibility among Combinatorial Problems, Plenum, New York, 1972 (Chapter).
9. J. Köbler, U. Schöning, J. Torán, The Graph Isomorphism Problem: Its Structural Complexity, Birkhäuser, Basel, Boston, 1993.
10. R. Mathon, A note on the graph isomorphism counting problem, Inform. Process. Lett. 8 (1979) 131-132.
11. R.C. Read, D.G. Corneil, The graph isomorphism disease, J. Graph Theory 1 (1977) 339-363.
12. J.P. Spinrad, Open Problem List, http://www.vuse.vanderbilt.edu/s~pin/ open.html, 1995.
13. J.P. Spinrad, Efficient Graph Representations, American Mathematical Society, Providence, RI, 2003.