Graph matching with type constraints on nodes and edges

Authors Catherine Fraikin, Paul Van Dooren

Thumbnail PDF


  • Filesize: 209 kB
  • 16 pages

Document Identifiers

Author Details

Catherine Fraikin
Paul Van Dooren

Cite AsGet BibTex

Catherine Fraikin and Paul Van Dooren. Graph matching with type constraints on nodes and edges. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of different type. The second problem treats graphs with edges of different types. In the two cases, the matching process is based on a constrained projection of the nodes and of the edges of both graphs in a lower dimensional space. The procedures are formulated as non-convex optimization problems. The objective functions use the adjacency matrices and the constraints on the problem impose the isometry of the so-called projections. Iterative algorithms are proposed to solve the optimization problems. As illustration, we give an example of graph matching for graphs with two types of nodes and graphs with two types of edges.
  • Graph matching
  • Optimization
  • Typed nodes
  • Typed edges


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail