Sökning: id:"swepub:oai:lup.lub.lu.se:15e75700-0fe9-4599-922d-0f50e58b1c97" >
Probably Optimal Gr...
Probably Optimal Graph Motifs
-
- Björklund, Andreas (författare)
- Lund University,Lunds universitet,Institutionen för datavetenskap,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Computer Science,Departments at LTH,Faculty of Engineering, LTH
-
Kaski, Petteri (författare)
-
Kowalik, Lukasz (författare)
-
visa fler...
-
Portier, Natacha (redaktör/utgivare)
-
Wilke, Thomas (redaktör/utgivare)
-
visa färre...
-
(creator_code:org_t)
- 2013
- 2013
- Engelska 12 s.
-
Ingår i: [Host publication title missing]. - 1868-8969. ; 20, s. 20-31
- Relaterad länk:
-
https://lup.lub.lu.s...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas