"A New Approach and Faster Exact Methods for the Maximum Common Subgraph ..."

W. Henry Suters et al. (2005)

> Home

Details and statistics

DOI: 10.1007/11533719_73

access: closed

type: Conference or Workshop Paper

metadata version: 2019-04-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/SutersAZSSL05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/SutersAZSSL05
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, Christopher T. Symons, Nagiza F. Samatova, Michael A. Langston:
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem. COCOON 2005: 717-727

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.