Login / Signup

Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces.

Heping GaoMeera Sitharam
Published in: SAC (2009)
Keyphrases
  • databases
  • cost effective
  • data sets
  • website
  • decision trees
  • object recognition
  • lightweight
  • constraint satisfaction problems
  • computationally expensive
  • bipartite graph
  • graph structure
  • graph mining