Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs.
Taisuke IzumiNaoki KitamuraTakamasa NaruseGregory SchwartzmanPublished in: CoRR (2022)
Keyphrases
- distributed computation
- bounded treewidth
- np complete
- distributed storage
- distributed databases
- decision problems
- conjunctive queries
- boolean functions
- scalability issues
- upper bound
- search space
- graph structure
- polynomial time complexity
- transitive closure
- np hard
- decision making
- query evaluation
- constraint graph
- tractable classes