
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Marco Gori, Marco Maggini, Lorenzo Sarti, "Exact and Approximate Graph Matching Using Random Walks," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 7, pp. 11001111, July, 2005.  
BibTex  x  
@article{ 10.1109/TPAMI.2005.138, author = {Marco Gori and Marco Maggini and Lorenzo Sarti}, title = {Exact and Approximate Graph Matching Using Random Walks}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {27}, number = {7}, issn = {01628828}, year = {2005}, pages = {11001111}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2005.138}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Exact and Approximate Graph Matching Using Random Walks IS  7 SN  01628828 SP1100 EP1111 EPD  11001111 A1  Marco Gori, A1  Marco Maggini, A1  Lorenzo Sarti, PY  2005 KW  Index Terms Exact graph matching KW  approximate graph matching KW  random walks KW  PageRank KW  image retrieval. VL  27 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] J.R. Ullmann, “An Algorithm For Subgraph Isomorphism,” J. ACM, vol. 23, no. 1, pp. 3142, 1976.
[2] D.C. Schmidt and L.E. Druffel, “A Fast Backtracking Algorithm to Test Directed Graphs For Isomorphism Using Distance Matrices,” J. ACM, vol. 23, no. 3, pp. 433445, 1976.
[3] B.D. McKay, “Practical Graph Isomorphism,” Congressus Numerantium, vol. 30, pp. 4587, 1981.
[4] L.P. Cordella, P. Foggia, C. Sansone, and M. Vento, “Performance Evaluation of the VF Graph Matching Algorithm,” Proc. 10th Int'l Conf. Image Analysis and Processing, pp. 11721177, 1999.
[5] M.A. Eschera and K.S. Fu, “A Graph Distance Measure for Image Analysis,” IEEE Trans. Systems, Man, and Cybernetics, vol. 14, pp. 398407, 1984.
[6] W.J. Christmas, J. Kittler, and M. Petrou, “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749764, Aug. 1995.
[7] K.A. DeJong and W.M. Spears, “Using Genetic Algorithm to Solve NPComplete Problems,” Proc. Int'l Conf. Genetic Algorithms, pp. 124132, 1989.
[8] S. Umeyama, “An Eigendecomposition Approach to Weighted Graph Matching Problems,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695703, May 1988.
[9] B. Luo and E.R. Hancock, “Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 11201136, Oct. 2001.
[10] F. DePiero, M. Trivedi, and S. Serbin, “Graph Matching Using a Direct Classification of Node Attendance,” Pattern Recognition, vol. 29, no. 6, pp. 10311048, 1996.
[11] L. Page, S. Brin, R. Motwani, and T. Winograd, “The PageRank Citation Ranking: Bringing Order to the Web,” technical report, Computer Science Dept., Stanford Univ., 1999.
[12] M. Diligenti, M. Gori, and M. Maggini, “A Unified Probabilistic Framework for Web Page Scoring Systems,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 1, pp. 416, Jan. 2004.
[13] E. Seneta, NonNegative Matrices and Markov Chains. SpringerVerlag, 1981.
[14] L. Padulo and M. Arbib, System Theory— A Unified Approach to Continous and Discrete Systems. Philadelphia, London, Toronto: W.B. Saunders Company, 1974.
[15] A. Pasini, “On Two Matrices Related to the Transition Matrix of a Graph,” technical report, Dipartimento di Matematica, Univ. di Siena, 2004.
[16] M. Bianchini, M. Gori, and F. Scarselli, “Inside PageRank,” ACM Trans. Internet Technology, 2005.
[17] H.W. Kuhn, “The Hungarian Method for the Assignment Problem,” Naval Research Logistics Quarterly, vol. 2, pp. 8397, 1955.
[18] P.K. Agarwal and K. Varadarajan, “Approximation Algorithms for Bipartite and NonBipartite Matching in the Plane,” Proc. 10th Ann. ACMSIAM Symp. Discrete Algorithms, pp. 805814, 1999.
[19] H.N. Gabow and R.E. Tarjan, “Faster Scaling Algorithms for Network Problems,” SIAM J. Computing, vol. 18, no. 5, pp. 10131036, 1989.
[20] P. Foggia, C. Sansone, and M. Vento, “A Database of Graphs for Isomorphism and Subgraph Isomorphism Benchmarking,” Proc. Third IAPR TC15 Int'l Workshop GraphBased Representations in Pattern Recognition, pp. 176187, 2001.
[21] P. Foggia, C. Sansone, and M. Vento, “A Performance Comparison of Five Algorithms for Graph Isomorphism,” Proc. Third IAPR TC15 Int'l Workshop GraphBased Representations in Pattern Recognition, pp. 188199, 2001.
[22] S.A. Nene, S.K. Nayar, and H. Murase, “Columbia Object Image Library (COIL100),” technical report, Columbia Univ., 1996.
[23] S.A. Nene, S.K. Nayar, and H. Murase, “RealTime 100 Object Recognition System,” Proc. IEEE Int'l Conf. Robotics and Automation, pp. 23212325, 1996.
[24] M. Pontil and A. Verri, “Support Vector Machines for 3D Object Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 6, pp. 637646, June 1998.
[25] C. DeMauro, M. Diligenti, M. Gori, and M. Maggini, “Similarity Learning for GraphBased Image Representations,” Proc. Third IAPR TC15 Int'l Workshop GraphBased Representations in Pattern Recognition, pp. 250259, 2001.
[26] M. Diligenti, M. Gori, and M. Maggini, “A Learning Algorithm for Web Page Scoring Systems,” Proc. 18th Int'l Joint Conf. Artificial Intelligence, pp. 575580, 2003.