Exploiting c-Closure in Kernelization Algorithms for Graph Problems.
Tomohiro KoanaChristian KomusiewiczFrank SommerPublished in: ESA (2020)
Keyphrases
- optimization problems
- related problems
- benchmark problems
- test problems
- graph theory
- problems in computer vision
- run times
- computational cost
- difficult problems
- search problems
- combinatorial optimization
- graph matching
- approximate solutions
- weighted graph
- depth first search
- worst case
- learning algorithm
- graph layout
- random graphs
- partitioning algorithm
- maximum weight
- graph representation
- connected components
- computationally efficient
- search algorithm
- data structure
- objective function