Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CPM
2008
Springer

favoriteEmaildiscussreport

170views Combinatorics» more CPM 2008»

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

13 years 6 months ago

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

Download www.cs.ucr.edu

Nadja Betzler, Michael R. Fellows, Christian Komus

Real-time Traffic

Combinatorics | CPM 2008 |

claim paper

Related Content

» Maximum common subgraph some upper bound and lower bound results

» The Parameterized Complexity of Some Minimum Label Problems

» Models For Dependable Computation with Multiple Inputs and Some Hardness Results

» BoundedDegree Techniques Accelerate Some Parameterized Graph Algorithms

» A KernighanLin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algor...

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

» Some novel locality results for the blob code spanning tree representation

» Constant Ratio FixedParameter Approximation of the Edge Multicut Problem

» Some statistical properties of regulatory DNA sequences and their use in predicting regula...

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	CPM
Authors	Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier

Comments (0)