Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs.
Pierre BergéGuillaume DucoffeMichel HabibPublished in: STACS (2022)
Keyphrases
- experimental evaluation
- computational complexity
- significant improvement
- cost function
- theoretical analysis
- optimization algorithm
- preprocessing
- times faster
- clustering method
- detection algorithm
- expectation maximization
- computationally efficient
- computational cost
- improved algorithm
- spanning tree
- graph isomorphism
- learning algorithm
- neural network
- worst case
- dynamic programming
- np hard
- recognition algorithm
- maximum common subgraph
- adjacency graph
- similarity measure
- median filter
- graph model
- objective function
- graph theory
- particle swarm optimization
- matching algorithm
- probabilistic model
- segmentation algorithm
- high accuracy