Lower Bounds for Graph Exploration Using Local Policies.
Aditya Kumar AkashSándor P. FeketeSeoung Kyou LeeAlejandro López-OrtizDaniela MaftuleacJames McLurkinPublished in: J. Graph Algorithms Appl. (2017)
Keyphrases
- information visualization
- lower bound
- upper bound
- random walk
- directed graph
- min sum
- graph structure
- branch and bound algorithm
- objective function
- graph representation
- np hard
- optimal policy
- optimal solution
- worst case
- bipartite graph
- directed acyclic graph
- upper and lower bounds
- graph theoretic
- constant factor
- branch and bound
- graph matching
- graph model
- lower and upper bounds
- image segmentation
- vc dimension
- special case
- constraint satisfaction problems
- connected components
- structured data