Login / Signup

k-NLC Graphs and Polynomial Algorithms.

Egon Wanke
Published in: Discret. Appl. Math. (1994)
Keyphrases
  • worst case
  • graph theory
  • computational complexity
  • decision trees
  • data structure
  • theoretical analysis
  • times faster
  • learning algorithm
  • web pages
  • random walk
  • constraint satisfaction problems
  • minimum spanning tree