Spectral Lower Bounds on the I/O Complexity of Computation Graphs.
Saachi JainMatei ZahariaPublished in: SPAA (2020)
Keyphrases
- lower bound
- worst case
- upper bound
- storage cost
- branch and bound algorithm
- graph theory
- average case complexity
- subgraph isomorphism
- input output
- computational complexity
- polynomial time complexity
- hyperspectral
- bipartite graph
- graph model
- graph databases
- lower and upper bounds
- spectral analysis
- graph matching
- spectral methods
- constraint satisfaction problems
- np hard
- database systems