Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs.
Pierre BergéGuillaume DucoffeMichel HabibPublished in: Theory Comput. Syst. (2024)
Keyphrases
- k means
- detection algorithm
- search space
- times faster
- high accuracy
- computational cost
- dynamic programming
- significant improvement
- preprocessing
- computational complexity
- optimal solution
- convergence rate
- cost function
- matching algorithm
- improved algorithm
- particle swarm optimization
- spanning tree
- graph isomorphism
- finding the shortest path
- experimental evaluation
- objective function
- similarity measure
- learning algorithm
- simulated annealing
- worst case
- computationally efficient
- theoretical analysis
- optimization algorithm
- tree structure
- np hard
- feature selection
- social networks
- neural network