Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems.
Tomohiro KoanaChristian KomusiewiczFrank SommerPublished in: SIAM J. Discret. Math. (2022)
Keyphrases
- optimization problems
- graph theory
- benchmark problems
- test problems
- computational complexity
- combinatorial optimization
- problems in computer vision
- related problems
- significant improvement
- practical problems
- maximum flow
- data structure
- approximate solutions
- difficult problems
- search problems
- graph representation
- graph model
- np complete