Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition.

Tuukka Korhonen Daniel Lokshtanov

Published in: SODA (2024)

Keyphrases

graph theory
computational complexity
significant improvement
worst case
learning algorithm
orders of magnitude
object recognition
pattern recognition
computational cost
computationally efficient
graphical models
recognition accuracy
recognition algorithm
character recognition
recognition process