Login / Signup

A Lower Bound for the Shortness Coefficient of a Class of Graphs.

Jochen HarantHansjoachim Walther
Published in: Discret. Appl. Math. (1994)
Keyphrases
  • lower bound
  • upper bound
  • np hard
  • branch and bound algorithm
  • objective function
  • semi supervised
  • spanning tree
  • feature selection
  • optimal solution
  • knn
  • graph structure
  • graph model
  • lower and upper bounds