Positive-Instance Driven Dynamic Programming for Graph Searching.
Max BannachSebastian BerndtPublished in: CoRR (2019)
Keyphrases
- dynamic programming
- random walk
- graph theoretic
- graph representation
- graph based algorithm
- connected components
- graph structure
- data driven
- markov decision processes
- graph theory
- directed graph
- graph model
- graph mining
- weighted graph
- coarse to fine
- greedy algorithm
- positively correlated
- structured data
- state space
- dependency graph
- dp matching
- dynamic programming algorithms
- graph matching
- positive and negative
- stereo matching
- spanning tree
- optimal policy
- stable set
- linear programming