Login / Signup
On symbolic OBDD-based algorithms for the minimum spanning tree problem.
Beate Bollig
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
times faster
theoretical analysis
computationally efficient
learning algorithm
recently developed
real time
optimization problems
computational cost
data structure
computer vision
worst case
lower bound
search algorithm
constraint satisfaction problems
data mining algorithms
computationally expensive
high level