An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs.
Marc TedderDerek G. CorneilPublished in: STACS (2007)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- learning algorithm
- np hard
- detection algorithm
- matching algorithm
- search space
- k means
- spanning tree
- distance metric
- weighted graph
- finding the shortest path
- undirected graph
- graph model
- graph matching
- preprocessing
- closed form
- distance function
- simulated annealing
- probabilistic model
- average distance
- graph isomorphism