Probably Optimal Graph Motifs
We show an O^*(2^k)-time polynomial space algorithm for the k-sized Graph Motif problem. We also introduce a new optimization variant of the problem, called Closest Graph Motif and solve it within the same time bound. The Closest Graph Motif problem encompasses several previously studied optimization variants, like Maximum Graph Motif, Min-Substitute, and Min-Add.
Moreover, we provide a piece of evidence that our result might be essentially tight: the existence of an O^*((2-epsilon)^k)-time algorithm for the Graph Motif problem implies an ((2-epsilon')^n)-time algorithm for Set Cover.
graph motif
FPT algorithm
20-31
Regular Paper
Andreas
Björklund
Andreas Björklund
Petteri
Kaski
Petteri Kaski
Lukasz
Kowalik
Lukasz Kowalik
10.4230/LIPIcs.STACS.2013.20
Creative Commons Attribution-NoDerivs 3.0 Unported license
https://creativecommons.org/licenses/by-nd/3.0/legalcode