Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs.

Taisuke Izumi Naoki Kitamura Takamasa Naruse Gregory Schwartzman

Published in: SPAA (2022)

Keyphrases

distributed computation
bounded treewidth
np complete
distributed storage
distributed databases
decision problems
conjunctive queries
boolean functions
scalability issues
tractable classes
data mining
computational complexity
database
bayesian networks
transitive closure
polynomial time complexity