Development of Several Reachability Algorithms for Directed Graphs.
Rudolf BerghammerHerbert EhlerHans ZiererPublished in: WG (1987)
Keyphrases
- directed graph
- learning algorithm
- random walk
- computationally efficient
- data structure
- computational complexity
- computational cost
- knowledge based systems
- computational efficiency
- times faster
- machine learning
- directed acyclic graph
- software engineering
- case study
- orders of magnitude
- combinatorial optimization
- maximum flow