文章基本信息

标题：Probably Optimal Graph Motifs
本地全文：下载
作者：Andreas Bj{\"o}rklund ; Petteri Kaski ; Lukasz Kowalik 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2013
卷号：20
页码：20-31
DOI：10.4230/LIPIcs.STACS.2013.20
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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