Subquadratic-time algorithm for the diameter and all eccentricities on median graphs.
Pierre BergéGuillaume DucoffeMichel HabibPublished in: CoRR (2021)
Keyphrases
- dynamic programming
- optimal solution
- optimization algorithm
- computational cost
- experimental evaluation
- times faster
- computationally efficient
- expectation maximization
- high accuracy
- probabilistic model
- matching algorithm
- k means
- search space
- computational complexity
- objective function
- graph structure
- improved algorithm
- random graphs
- learning algorithm
- worst case
- np hard
- cost function
- mobile robot
- convergence rate
- significant improvement
- neural network
- weighted distance
- maximum distance
- polynomial time complexity
- finding the shortest path