Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs.
Grzegorz KwasniewskiTal Ben-NunLukas GianinazziAlexandru CalotoiuTimo SchneiderAlexandros Nikolaos ZiogasMaciej BestaTorsten HoeflerPublished in: SPAA (2021)
Keyphrases
- lower bound
- upper bound
- graph theory
- branch and bound algorithm
- branch and bound
- worst case
- np hard
- optimal solution
- upper and lower bounds
- objective function
- directed graph
- graph theoretic
- lower bounding
- lower and upper bounds
- input output
- weighted graph
- graph mining
- graph databases
- graph matching
- main memory
- quadratic assignment problem
- computer programs
- graph representation
- vc dimension
- image registration