"A Novel Efficient Algorithm for Determining Maximum Common Subgraphs."

Yu Wang, Carsten Maple (2005)

> Home

Details and statistics

DOI: 10.1109/IV.2005.11

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/iv/WangM05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iv/WangM05
Yu Wang, Carsten Maple:
A Novel Efficient Algorithm for Determining Maximum Common Subgraphs. IV 2005: 657-663

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.