External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Andrea Calabrese

This author has not been identified. Look up 'Andrea Calabrese' in Google

Lorenzo Cardone

This author has not been identified. Look up 'Lorenzo Cardone' in Google

Salvatore Licata

This author has not been identified. Look up 'Salvatore Licata' in Google

Marco Porro

This author has not been identified. Look up 'Marco Porro' in Google

Stefano Quer

This author has not been identified. Look up 'Stefano Quer' in Google
runs on