Efficient parameterized algorithms for computing all-pairs shortest paths.
Stefan KratschFlorian NellesPublished in: CoRR (2020)
Keyphrases
- computationally efficient
- significant improvement
- computationally expensive
- shortest path
- theoretical analysis
- optimization problems
- computational cost
- objective function
- data structure
- single pass
- parallel architectures
- computationally demanding
- computer vision
- computationally intensive
- highly efficient
- efficient implementation
- neural network
- efficient algorithms for computing
- algorithms and data structures
- times faster
- cost effective
- orders of magnitude
- benchmark datasets
- bayesian networks
- database systems
- decision trees
- learning algorithm
- genetic algorithm