Login / Signup
On space efficiency of algorithms working on structural decompositions of graphs.
Michal Pilipczuk
Marcin Wrochna
Published in:
CoRR (2015)
Keyphrases
</>
data structure
learning algorithm
computational complexity
computational efficiency
highly efficient
low dimensional
orders of magnitude
times faster
graph theory
bayesian networks
high dimensional
relational databases
computational cost
theoretical analysis
weighted graph
minimum spanning tree