Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.
Nadja BetzlerMichael R. FellowsChristian KomusiewiczRolf NiedermeierPublished in: CPM (2008)
Keyphrases
- graph theory
- optimization problems
- computational complexity
- np complete
- benchmark problems
- polynomial time complexity
- hard problems
- combinatorial optimization
- partial solutions
- data mining tasks
- np hardness
- learning algorithm
- worst case
- graph representation
- minimum spanning tree
- problems in computer vision
- test problems
- data mining techniques
- strongly connected
- graph layout