Subexponential Time Algorithms for Embedding H-Minor Free Graphs.

Hans L. Bodlaender Jesper Nederlof Tom C. van der Zanden

Published in: ICALP (2016)

Keyphrases

computationally efficient
orders of magnitude
computational complexity
theoretical analysis
learning algorithm
significant improvement
computational cost
optimization problems
graph construction
graph embedding
search algorithm
worst case
benchmark datasets
combinatorial optimization
graph theory