Sciweavers

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

105

ALGORITHMICA
2008

42views more ALGORITHMICA 2008»

Solving Connected Dominating Set Faster than 2 n

15 years 2 months ago

Solving Connected Dominating Set Faster than 2 n

Download www.dsi.uniroma1.it

Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch

Real-time Traffic

ALGORITHMICA 2008 |

claim paper

Related Content

» An Olog n dominating set protocol for wireless adhoc networks under the physical interfere...

» An optimal maximal independent set algorithm for boundedindependence graphs

» Linear kernels for connected dominating set on Hminorfree graphs

» Partitioning Graphs into Connected Parts

» Optimal Rectangle Packing New Results

» Subexponential Algorithms for Partial Cover Problems

» Escaping a grid by edgedisjoint paths

» Dynamic Programming and Fast Matrix Multiplication

» DataDriven Visualization and Group Analysis of Multichannel EEG Coherence with Functional ...

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2008
Where	ALGORITHMICA
Authors	Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch

Comments (0)