Fast algorithm for graph isomorphism testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5526 LNCS, Issue , 2009, Pages 221-232

  López Presa, José Luis ^a   Fernández Anta, Antonio ^b  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMORPHISMS; DIRECT APPROACH; FAST ALGORITHMS; GRAPH ISOMORPHISM; GRAPH ISOMORPHISM PROBLEM; HIGH PROBABILITY; INPUT GRAPHS; OTHER ALGORITHMS; PRECOMPUTING; PROBLEM INSTANCES; RANDOM GRAPHS; SEARCH TREES; SPACE COMPLEXITY;

ALGORITHMS; SET THEORY;

GRAPH THEORY;

EID: 68749119788     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02011-7_21     Document Type: Conference Paper

References (18)

1. Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. In: FOCS 2002 (2002)
2. Babai, L., Kučera, L.: Canonical labeling of graphs in linear average time. In: FOCS 1979 (1979)
3. Babai, L., Luks, E.M.: Canonical labeling of graphs. In: STOC 1983 (1983)
4. Boppana, R., Hastad, J., Zachos, S.: Does co-NP have short interactive proofs? Information Processing Letters 25, 27-32 (1987)
5. Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: Proc. of the 3rd IAPR-TC-15 Int'l Workshop on Graph-based Representations (2001)
6. Czajka, T., Pandurangan, G.: Improved random graph isomorphism. J. of Discrete Algorithms 6(1), 85-92 (2008)
7. Fortin, S.: The graph isomorphism problem. Technical Report TR 96-20, U. of Alberta, Edmonton, Alberta, Canada (July 1996)
8. Gati, G.: Further annotated bibliography on the isomorphism disease. J. of Graph Theory 3(2), 95-109 (2006)
9. Goldberg, M.: The graph isomorphism problem. In: Gross, J.L., Yellen, J. (eds.) Handbook of graph theory. Discrete Mathematics and its Applications, ch. 2.2, pp. 68-78. CRC Press, Boca Raton (2003)
10. Mathon, R.: A note on the graph isomorphism counting problem. Information Processing Letters 8(3), 131-132 (1979)
11. McKay, B.D.: Practical graph isomorphism. Congr. Numer. 30, 45-87 (1981)
12. McKay, B.D.: The nauty page. CS Dept., Australian National U. (2004), http://cs.anu.edu.au/~bdm/nauty/
13. Miyazaki, T.: The complexity of McKay's canonical labeling algorithm. In: Finkelstein, L., Kantor, W.M. (eds.) Groups and Computation II. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 28 (1997)
14. López Presa, J.L.: Efficient Algorithms for Graph Isomorphism Testing. Ph.D thesis, ETSI Telecomunicación, U. Rey Juan Carlos, Madrid, Spain (March 2009), http://www.diatel.upm.es/jllopez/tesis/thesis.pdf
15. Read, R.C., Corneil, D.G.: The graph isomorphism disease. J. of Graph Theory 1, 339-363 (1977)
16. Schöning, U.: Graph isomorphism is in the low hierarchy. J. of Computer and System Sciences 37(3), 312-323 (1988)
17. Singler, J.: Graph isomorphism implementation in LEDA 5.1. Technical report, Algorithmic Solutions Software GmbH (December 2005)
18. Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1) (1976)