Graph matching with type constraints

2007 European Control Conference, ECC 2007

Volumn , Issue , 2007, Pages 1688-1694

  Fraikin, Catherine ^a   Van Dooren, Paul ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Graph matching; Optimization; Typed nodes

Indexed keywords

CONVEX OPTIMIZATION; GRAPHIC METHODS; ITERATIVE METHODS; OPTIMIZATION; PATTERN MATCHING;

ADJACENCY MATRICES; DIMENSIONAL SPACES; GRAPH MATCHINGS; ITERATIVE ALGORITHM; NONCONVEX OPTIMIZATION; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; TYPED NODES;

DIRECTED GRAPHS;

EID: 84927722964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.23919/ecc.2007.7068549     Document Type: Conference Paper

References (5)

1. D. CONTE, P. FOGGIA, C. SANSONE AND M. VENTO, "Thirty years of graph matching in pattern recognition", Int. J. Pattern Recognition and Artificial Intelligence, Vol. 18(3), pp. 265-298, 2004.
2. T. CAELLI AND S. KOSINOV, "An eigenspace projection clustering method for inexact graph matching," IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. 26(4), pp. 515-519, 2004.
3. C. FRAIKIN, Y. NESTEROV AND P. VAN DOOREN, "Optimizing the coupling between two isometric projections of matrices", submitted to SIAM J. Matrix Anal. Appl., 2006.
4. V. BLONDEL, A. GAJARDO, M. HEYMANS, P. SENNELART AND P. VAN DOOREN, "Measure of similarity between graph vertices. Applications to synonym extraction and web searching". SIAM Review, pp. 647-666, Vol. 46, 2004.
5. R. BROCKETT, "Singular values and least squares matching". Proc. 36th IEEE Conf. on Dec. And Control, San Diego, CA, pp. 1121-1124, 1997.