A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks.
Ulrik BrandesWolfram SchlickenriederGabriele NeyerDorothea WagnerKarsten WeihePublished in: Discret. Appl. Math. (1999)
Keyphrases
- software package
- data structure
- open source
- times faster
- disjoint paths
- learning algorithm
- search algorithm
- software packages
- optimization problems
- user friendly
- markov chain
- approximation algorithms
- heuristic search
- computationally efficient
- computational cost
- significant improvement
- computational complexity
- social networks