License: 
Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2013.20
URN: urn:nbn:de:0030-drops-39196
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/3919/
Björklund, Andreas ;
Kaski, Petteri ;
Kowalik, Lukasz
Probably Optimal Graph Motifs
Abstract
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.
BibTeX - Entry
@InProceedings{bjrklund_et_al:LIPIcs:2013:3919,
author = {Andreas Bj{\"o}rklund and Petteri Kaski and Lukasz Kowalik},
title = {{Probably Optimal Graph Motifs}},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
pages = {20--31},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-50-7},
ISSN = {1868-8969},
year = {2013},
volume = {20},
editor = {Natacha Portier and Thomas Wilke},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3919},
URN = {urn:nbn:de:0030-drops-39196},
doi = {10.4230/LIPIcs.STACS.2013.20},
annote = {Keywords: graph motif, FPT algorithm}
}
|
Keywords: |
|
graph motif, FPT algorithm |
|
Collection: |
|
30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) |
|
Issue Date: |
|
2013 |
|
Date of publication: |
|
26.02.2013 |
