Superlinear lower bounds for multipass graph processing
Venkatesan GuruswamiKrzysztof OnakPublished in: CoRR (2012)
Keyphrases
- lower bound
- upper bound
- real time
- graph theory
- branch and bound algorithm
- objective function
- quadratic assignment problem
- lower and upper bounds
- graph representation
- graph partitioning
- directed acyclic graph
- bipartite graph
- directed graph
- information processing
- random walk
- graph model
- data processing
- worst case
- np hard
- graph theoretic
- optimal solution
- graph matching
- spanning tree
- vc dimension
- upper and lower bounds
- lower bounding
- constant factor
- min sum