Weak pattern matching in colored graphs: Minimizing the number of connected components

Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Weak pattern matching in colored graphs: Minimizing the number of connected components. In Giuseppe F. Italiano, Eugenio Moggi, Luigi Laura, editors, Theoretical Computer Science, 10th Italian Conference, ICTCS 2007, Rome, Italy, October 3-5, 2007, Proceedings. pages 27-38, World Scientific, 2007.

@inproceedings{DondiFV07,
  title = {Weak pattern matching in colored graphs: Minimizing the number of connected components},
  author = {Riccardo Dondi and Guillaume Fertin and Stéphane Vialette},
  year = {2007},
  tags = {graph-rewriting, pattern matching, rewriting},
  researchr = {https://researchr.org/publication/DondiFV07},
  cites = {0},
  citedby = {0},
  pages = {27-38},
  booktitle = {Theoretical Computer Science, 10th Italian Conference, ICTCS 2007, Rome, Italy, October 3-5, 2007, Proceedings},
  editor = {Giuseppe F. Italiano and Eugenio Moggi and Luigi Laura},
  publisher = {World Scientific},
  isbn = {981-277-098-4},
}