Graph matching with type constraints on nodes and edges

Catherine Fraikin, Paul Van Dooren. Graph matching with type constraints on nodes and edges. In Andreas Frommer, Michael W. Mahoney, Daniel B. Szyld, editors, Web Information Retrieval and Linear Algebra Algorithms, 11.02. - 16.02.2007. Volume 07071 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2007. [doi]

@inproceedings{FraikinD07,
  title = {Graph matching with type constraints on nodes and edges},
  author = {Catherine Fraikin and Paul Van Dooren},
  year = {2007},
  url = {http://drops.dagstuhl.de/opus/volltexte/2007/1071},
  tags = {constraints, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/FraikinD07},
  cites = {0},
  citedby = {0},
  booktitle = {Web Information Retrieval and Linear Algebra Algorithms, 11.02. - 16.02.2007},
  editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld},
  volume = {07071},
  series = {Dagstuhl Seminar Proceedings},
  publisher = {Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany},
}