"Indexing with Well-Founded Total Order for Faster Subgraph Isomorphism ..."

Markus Weber, Marcus Liwicki, Andreas Dengel (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-20844-7_19

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/gbrpr/WeberLD11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gbrpr/WeberLD11
Markus Weber, Marcus Liwicki, Andreas Dengel:
Indexing with Well-Founded Total Order for Faster Subgraph Isomorphism Detection. GbRPR 2011: 185-194

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.