Graph matching with type constraints on nodes and edges

Dagstuhl Seminar Proceedings

Volumn 7071, Issue , 2007, Pages

  Fraikin, Catherine ^a   Van Dooren, Paul ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Graph matching; Optimization; Typed edges; Typed nodes

Indexed keywords

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

CONVEX OPTIMIZATION PROBLEMS; GRAPH MATCHINGS; LOW-DIMENSIONAL SPACES; MATCHING PROCESS; NONCONVEX OPTIMIZATION; OBJECTIVE FUNCTIONS; OPTIMISATIONS; TYPE CONSTRAINTS; TYPED EDGE; TYPED NODE;

DIRECTED GRAPHS;

EID: 73249122174     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognition and Artificial Intelligence 18 (2004) 265-298
2. Caelli, T., Kosinov, S.: An eigenspace projection clustering method for inexact graph matching. IEEE Trans. Pattern Analysis and Machine Intelligence 26 (2004) 515-519
3. Fraikin, C., Nesterov, Y., Dooren, P.V.: Optimizing the coupling between two isometric projections of matrices. Submitted to SIAM J. Matrix Anal. Appl. (2006)
4. Blondel, V.D., Gajardo, A., Heymans, M., Senellart, P., Van Dooren, P.: A measure of similarity between graph vertices: applications to synonym extraction and Web searching. SIAM Rev. 46 (2004) 647-666
5. Zager, L., Verghese, G.: Graph similarity scoring and matching. To appear in Applied Math. Letters (2007)
6. Fraikin, C., Dooren, P.V.: Graph matching with type constraints. Proc. Europ. Control Conf.(ECC'07) (2007)