Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition.
Tuukka KorhonenDaniel LokshtanovPublished in: CoRR (2023)
Keyphrases
- learning algorithm
- computational complexity
- graph theory
- theoretical analysis
- data structure
- significant improvement
- computational cost
- worst case
- recognition rate
- computationally efficient
- graph theoretic
- recognition accuracy
- activity recognition
- orders of magnitude
- np complete
- representational power
- maximum clique