Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs.
Sayan BandyapadhyayWilliam LochetDaniel LokshtanovSaket SaurabhJie XuePublished in: CoRR (2021)
Keyphrases
- optimization problems
- related problems
- difficult problems
- benchmark problems
- combinatorial optimization
- computationally efficient
- polynomial time complexity
- hard problems
- problems in computer vision
- np complete
- graphical models
- graph theory
- test problems
- computational cost
- data structure
- planar graphs
- semi supervised
- graph mining
- practical problems
- significant improvement
- search algorithm
- run times
- learning algorithm