Algorithms for Parsimonious Complete Sets in Directed Graphs.
Avraham A. MelkmanSolomon Eyal ShimonyPublished in: Inf. Process. Lett. (1996)
Keyphrases
- directed graph
- data structure
- learning algorithm
- computational efficiency
- computational cost
- strongly connected
- maximum flow
- recently developed
- orders of magnitude
- theoretical analysis
- np hard
- social networks
- random walk
- computationally efficient
- markov chain
- significant improvement
- times faster
- computational complexity
- decision trees
- convergence rate
- directed acyclic graph
- machine learning