QAPV: A polynomial invariant for graph isomorphism testing

Pesquisa Operacional

Volumn 33, Issue 2, 2013, Pages 163-184

  de Melo, Valdir Agustinho ^a   Boaventura Netto, Paulo Oswaldo ^a   Bahiense, Laura ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Graph isomorphism; Quadratic assignment problem; Variance

Indexed keywords

EID: 84881607076     PISSN: 01017438     EISSN: 16785142     Source Type: Journal    
DOI: 10.1590/S0101-74382013000200002     Document Type: Article

References (34)

1. ABREU NMM, BOAVENTURA-NETTO PO, QUERIDO TM & GOUVÊA EF. 2002. Classes of quadratic assignment problem instances: isomorphism and difficulty measures using a statistical approach. Discrete Applied Mathematics, 124: 103-116.
2. ARVIND V & THORÁN J. 1985. Isomorphism testing: perspective and open problems. The ComputationalComplexityColumn. BulletinoftheEuropeanAssociationforTheoreticalComputerScience, 86: 66-84. In: http://theorie.informatik.uni-ulm.de/Personen/jt.html. Consulted June 2010.
3. ANGEL R & ZISSIMOPOULOS V. 1998. On the quality of the local search for the quadratic assignment problem. Discrete Applied Mathematics, 82: 15-25.
4. BOAVENTURA-NETTO PO & ABREU NMM. 1997. Cost solution average and variance for the quadratic assignment problem: a polynomial expression for the variance of solutions. Actas de Resumenes Extendidos, 408-413, I ELIO/Optima 97, Concepción, Chile.
5. BOAVENTURA-NETTO PO. 2012. Grafos: Teoria, Modelos, Algoritmos (in Portuguese). 5th ed., Edgard Blücher, São Paulo. http://www.po.coppe.ufrj.br/docentes/boaventura/home.html.
6. BESSA AD, ROCHA-NETO IC, PINHO STR, ANDRADE RFS & PETIT LOBÃO TC. 2012. Graph cospectrality using neighborhood matrices. Electronic Journal of Combinatorics, 19(3): 23.
7. CVETKOVIC D, ROWLINSON P & SIMIC S. 1997. Eigenspaces of graphs, Cambridge University Press, Cambridge.
8. CROSS ADJ, WILSON RC & HANCOCK ER. 1997. Inexact graph matching using genetic search. Pattern Recognition, 30(6), 953-970.
9. CZERWINSKI R. 2010. A polynomial time algorithm for graph isomorphism. http://arxiv.org/pdf/0711.2010v4. Consulted August 2011.
10. DEPIERO F & KROUT D. 2003. An algorithm using length-r paths to approximate subgraph isomorphism. Pattern Recognition Letters, 24: 33-46.
11. DING H & HUANG Z. 2009. Isomorphism identification of graphs: especially for the graphs of kinematic chains. Mechanism and Machine Theory, 44: 122-139.
12. DOUGLAS B. 2011. The Weisfeiler-Lehman method and graph isomorphism testing. http://arxiv.org/pdf/1101.5211v1. Consulted August 2011.
13. DHARWADKER A & TEVET J. 2009. The graph isomorphism algorithm. In Proceedings of the Structure Semiotics Research Group. Eurouniversity Tallinn. Also in http://www.dharwadker.org/tevet/isomorphism/. Consulted June 2010.
14. FOGGIA P, SANSONE C & VENTO M. 2001. A performance comparison of five algorithms for graph isomorphism. Proc. of the 3rd. IAPR-TC-15 International Workshop on Graph-based Representations, Venice, Italy.
15. GAREY MR & JOHNSON DS. 1979. Computers and intractability: a guide to NP-completedness. W.H. Freeman.
16. GORI M, MAGGINI M & SARTI L. 2001. Graph matching using random walks. Proc. of the 3rd. IAPR-TC-15 International Workshop on Graph-based Representations, Venice, Italy.
17. GRAVES GW & WHINSTON AB. 1970. An algorithm for the quadratic assignment problem. Management Science, 17: 453-471.
18. GROSS JL & YELLEN J. (eds.) 2005. Handbook of graph theory, CRC Press LLC, Boca Raton.
19. HARARY F. 1971. Graph theory, Addison-Wesley, Reading, Massachussetts.
20. HAEMERS WH & SPENCE E. 2001. The pseudo-geometric graphs for generalized quadrangles of order.3. European J. Combin., 22(6): 839-845.
21. IGRAPH LIBRARY. http://igraph.sourceforge.net/ Consulted June 2012.
22. JAIN BJ & WYSOTSKI F. 2005. Solvinginexactgraphisomorphismproblemsusingneuralnetworks. Neurocomputing, 63: 45-67.
23. KNUTH D. 1997. The art of computer programming, vol. 2, Seminumerical algorithms. 3rd ed., Addison-Wesley, Reading, Massachussetts.
24. LOIOLA EM, ABREU NMM, BOAVENTURA-NETTO PO, HAHN P & QUERIDO TM. 2007. A survey for the quadratic assignment problem. European J. of Operational Research, 176: 657-690.
25. LEE L, RANGEL MC & BOERES MCS. 2007. Reformulação do problema de isomorfismo de grafos como o problema quadrático de alocação (in Portuguese), Anais do XXXIX SBPO, 1601-1612, Fortaleza.
26. MELO VA, BOAVENTURA-NETTO PO, HAHN P & BAHIENSE L. 2010. Graph isomorphism and QAP variances. Combinatorial optimization in practice, 8(2): 209-234.
27. MCKAY B. 1981. Practical graph isomorphism. Congressus Numerantium, 30(1): 45-87.
28. MARSAGLIA G. 1984. A current view of random number generators. Keynote address, Proc. 16th Symposium on the Interface, Atlanta. Elsevier.
29. PORUMBEL DC. 2011. Isomorphism testing via polynomial-time graph extensions. Journal of Mathematical Modelling and Algorithms, 10(2): 119-143.
30. PRESA JLL. 2009. Efficient algorithms for graph isomorphism testing. D. Sc. Thesis, Universidad Rey Juan Carlos, Madrid.
31. SANTOS PLF. 2010. Teoria espectral de grafos aplicada ao problema de isomorfismo de grafos (in Portuguese). M. Sc. Dissertation, Department of Informatics, Federal University of Esprito Santo, Brazil.
32. SANTO M DE, FOGGIA P, SANSONE C & VENTO M. 2003. A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recognition Letters, 24: 1067-1079.
33. http://www.cs.sunysb.edu/_algorith/implement/vflib/implement.shtml. Consulted May 2012.
34. VOSS S & SUBHLOK J. 2010. Performance of general graph isomorphism algorithms. Technical Report Number UH-CS-09-07, Department of Computer Science, University of Houston, Houston, TX, 77204, USA. http://www.cs.uh.edu/docs/cosc/technical-reports/2010/09 07.pdf.