A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
Michael R. FellowsJiong GuoHannes MoserRolf NiedermeierPublished in: MFCS (2009)
Keyphrases
- similar problems
- computational issues
- benchmark problems
- practical solutions
- optimal or near optimal
- problems involving
- specific problems
- computational complexity
- decision problems
- partial solutions
- difficult problems
- tractable cases
- np hardness
- search heuristics
- data mining
- heuristic methods
- test problems
- solution quality
- genetic algorithm