Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.
Yun Kuen CheungGramoz GoranciMonika HenzingerPublished in: CoRR (2016)
Keyphrases
- lower and upper bounds
- lower bound
- upper bound
- upper and lower bounds
- lagrangian relaxation
- random walk
- graph structure
- graph theory
- directed graph
- graph matching
- bipartite graph
- graph representation
- structured data
- data structure
- distance function
- valid inequalities
- distance matrix
- weighted graph
- branch and bound
- itemsets
- exact and approximate