Login / Signup

Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time.

Heiko Dörr
Published in: WG (1994)
Keyphrases
  • high level
  • worst case
  • complex structures
  • data sets
  • feature selection
  • search space
  • shortest path
  • subgraph isomorphism