"Mining Frequent Connected Subgraphs Reducing the Number of Candidates."

Andrés Gago Alonso et al. (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-87479-9_42

access: open

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/pkdd/AlonsoMCT08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pkdd/AlonsoMCT08
Andrés Gago Alonso, José Eladio Medina-Pagola, Jesús Ariel Carrasco-Ochoa, José Francisco Martínez Trinidad:
Mining Frequent Connected Subgraphs Reducing the Number of Candidates. ECML/PKDD (1) 2008: 365-376

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.