A Web Scraping Algorithm to Improve the Computation of the Maximum Common Subgraph

Andrea Calabrese, Lorenzo Cardone, Salvatore Licata, Marco Porro, Stefano Quer. A Web Scraping Algorithm to Improve the Computation of the Maximum Common Subgraph. In Hans-Georg Fill, Francisco José Domínguez-Mayo, Marten van Sinderen, Leszek A. Maciaszek, editors, Proceedings of the 18th International Conference on Software Technologies, ICSOFT 2023, Rome, Italy, July 10-12, 2023. pages 197-206, SCITEPRESS, 2023. [doi]

@inproceedings{CalabreseCLPQ23,
  title = {A Web Scraping Algorithm to Improve the Computation of the Maximum Common Subgraph},
  author = {Andrea Calabrese and Lorenzo Cardone and Salvatore Licata and Marco Porro and Stefano Quer},
  year = {2023},
  doi = {10.5220/0012130800003538},
  url = {https://doi.org/10.5220/0012130800003538},
  researchr = {https://researchr.org/publication/CalabreseCLPQ23},
  cites = {0},
  citedby = {0},
  pages = {197-206},
  booktitle = {Proceedings of the 18th International Conference on Software Technologies, ICSOFT 2023, Rome, Italy, July 10-12, 2023},
  editor = {Hans-Georg Fill and Francisco José Domínguez-Mayo and Marten van Sinderen and Leszek A. Maciaszek},
  publisher = {SCITEPRESS},
  isbn = {978-989-758-665-1},
}