A Tight Bound for Shortest Augmenting Paths on Trees.

Bartlomiej Bosek Dariusz Leniowski Piotr Sankowski Anna Zych-Pawlewicz

Published in: LATIN (2018)

Keyphrases

lower bound
upper bound
shortest path
worst case
path length
generalization error bounds
decision trees
tree structure
data mining
tree nodes
objective function
bayesian networks
error bounds
path finding
real world
tree edit distance
binary trees
real time