Weighted Graph-Matching Using Modal Clusters

Marco Carcassoni, Edwin R. Hancock. Weighted Graph-Matching Using Modal Clusters. In Wladyslaw Skarbek, editor, Computer Analysis of Images and Patterns, 9th International Conference, CAIP 2001 Warsaw, Poland, September 5-7, 2001, Proceedings. Volume 2124 of Lecture Notes in Computer Science, pages 142-151, Springer, 2001. [doi]

@inproceedings{CarcassoniH01:0,
  title = {Weighted Graph-Matching Using Modal Clusters},
  author = {Marco Carcassoni and Edwin R. Hancock},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2124/21240142.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/CarcassoniH01%3A0},
  cites = {0},
  citedby = {0},
  pages = {142-151},
  booktitle = {Computer Analysis of Images and Patterns, 9th International Conference, CAIP 2001 Warsaw, Poland, September 5-7, 2001, Proceedings},
  editor = {Wladyslaw Skarbek},
  volume = {2124},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42513-6},
}