Catalan structures and dynamic programming in H-minor-free graphs.
Frederic DornFedor V. FominDimitrios M. ThilikosPublished in: J. Comput. Syst. Sci. (2012)
Keyphrases
- dynamic programming
- introduce a general framework
- graph structures
- complex structures
- greedy algorithm
- state space
- graph theoretic
- directed graph
- bipartite graph
- finding the shortest path
- graph structure
- linear programming
- graph theory
- data sets
- graph databases
- coarse to fine
- stereo matching
- data representations
- multiscale
- bayesian networks