Maximum Common Subgraph Isomorphism Algorithms

Duesbury, E., Holliday, J.D. and Willett, P. orcid.org/0000-0003-4591-7173 (2017) Maximum Common Subgraph Isomorphism Algorithms. MATCH Communications in Mathematical and in Computer Chemistry, 77 (2). pp. 213-232. ISSN 0340-6253

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2016 MATCH. This is an author produced version of a paper subsequently published in MATCH Commun. Math. Comput. Chem. Uploaded with permission from the copyright holder.
Dates:
  • Accepted: 30 June 2016
  • Published (online): April 2017
  • Published: April 2017
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Social Sciences (Sheffield) > Information School (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 16 Aug 2016 08:45
Last Modified: 30 Jun 2017 16:25
Published Version: http://match.pmf.kg.ac.rs/content77n2.htm
Status: Published
Refereed: Yes

Download

Filename: MCS_review_final.pdf

Share / Export