Sciweavers

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

103

Voted

CORR
2010
Springer

122views Education» more CORR 2010»

Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs

14 years 11 months ago

Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs

Download www.lirmm.fr

Mathieu Chapelle

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» ROMAN DOMINATION a parameterized perspective

» Domination Problems in NowhereDense Classes

» The Complexity Ecology of Parameters An Illustration Using Bounded Max Leaf Number

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

» Subexponential Algorithms for Partial Cover Problems

» The Parameterized Complexity of Some Minimum Label Problems

» The Parameterized Complexity of the Induced Matching Problem in Planar Graphs

» On Parameterized Exponential Time Complexity

» The effect of girth on the kernelization complexity of Connected Dominating Set

Post Info
More Details (n/a)

Added	22 Mar 2011
Updated	22 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Mathieu Chapelle

Comments (0)