Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case.
Igor B. BourdonovAlexander S. KossatchevVictor V. KuliaminPublished in: Program. Comput. Softw. (2003)
Keyphrases
- directed graph
- data structure
- computational complexity
- computational cost
- black box
- computationally efficient
- data mining
- machine learning
- social networks
- decision trees
- machine learning algorithms
- combinatorial optimization
- randomized algorithms
- data sets
- graph structures
- times faster
- orders of magnitude
- benchmark datasets
- random walk
- search space
- objective function