"A Comparison of Algorithms for Maximum Common Subgraph on Randomly ..."

Horst Bunke et al. (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-70659-3_12

access: closed

type: Conference or Workshop Paper

metadata version: 2023-04-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sspr/BunkeFGSV02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sspr/BunkeFGSV02
Horst Bunke, Pasquale Foggia, Corrado Guidobaldi, Carlo Sansone, Mario Vento:
A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs. SSPR/SPR 2002: 123-132

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.