Superlinear Lower Bounds for Multipass Graph Processing.
Venkatesan GuruswamiKrzysztof OnakPublished in: Computational Complexity Conference (2013)
Keyphrases
- lower bound
- upper bound
- real time
- data processing
- random walk
- min sum
- graph theory
- objective function
- graph theoretic
- information processing
- directed graph
- np hard
- spanning tree
- graph databases
- graph model
- directed acyclic graph
- worst case
- bipartite graph
- branch and bound
- graph matching
- graph partitioning
- graph representation
- lower and upper bounds
- online algorithms
- quadratic assignment problem
- graph based algorithm
- optimal solution