On the Power of Tree-Depth for Fully Polynomial FPT Algorithms.

Yoichi Iwata Tomoaki Ogasawara Naoto Ohsaka

Published in: STACS (2018)

Keyphrases

computational complexity
learning algorithm
significant improvement
machine learning algorithms
computationally efficient
tree structures
lower bound
optimization problems
times faster
stereo vision
spanning tree
tree mining
fixed parameter tractable