Parameterized Counting Algorithms for General Graph Covering Problems.
Naomi NishimuraPrabhakar RagdeDimitrios M. ThilikosPublished in: WADS (2005)
Keyphrases
- computationally hard
- specific problems
- graph theory
- optimization problems
- practical problems
- benchmark problems
- special case
- graph layout
- test problems
- computationally efficient
- computational complexity
- difficult problems
- image segmentation
- random graphs
- problems in computer vision
- theoretical guarantees
- learning algorithm
- related problems
- search methods
- combinatorial optimization
- approximate solutions
- np hard
- significant improvement
- search algorithm
- exact and approximate
- data structure
- partitioning algorithm
- run times
- graph properties
- data mining
- structured prediction problems