Finding Good Decompositions for Dynamic Programming on Dense Graphs.

Eivind Magnus Hvidevold Sadia Sharmin Jan Arne Telle Martin Vatshelle

Published in: IPEC (2011)

Keyphrases

dynamic programming
finding the shortest path
coarse to fine
graph matching
optimal control
graph representation
similarity measure
depth map
graph theoretic
maximum clique