Login / Signup

Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case.

Igor B. BourdonovAlexander S. KossatchevVictor V. Kuliamin
Published in: Program. Comput. Softw. (2004)
Keyphrases
  • directed graph
  • neural network
  • dynamic programming
  • random walk
  • benchmark datasets
  • orders of magnitude
  • maximum flow
  • strongly connected
  • decision trees
  • significant improvement
  • special case
  • worst case
  • finite automata