Sciweavers

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

70

Voted

COCOON
2007
Springer

favoriteEmaildiscussreport

87views Combinatorics» more COCOON 2007»

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

15 years 5 months ago

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

Download www.cs.tau.ac.il

Noga Alon, Shai Gutner

Real-time Traffic

COCOON 2007 |

claim paper

Related Content

» Linear kernels for connected dominating set on Hminorfree graphs

» Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs

» Computational Study on Dominating Set Problem of Planar Graphs

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

» A Linear Algorithm for Finding the Invariant Edges of an EdgeWeighted Graph

» Bidimensionality and Kernels

» Messageoptimal connected dominating sets in mobile ad hoc networks

» Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating S...

» Triangle Fixing Algorithms for the Metric Nearness Problem

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	COCOON
Authors	Noga Alon, Shai Gutner

Comments (0)