Sciweavers

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

66

SODA
2003
ACM

96views Algorithms» more SODA 2003»

Dominating sets in planar graphs: branch-width and exponential speed-up

15 years 4 months ago

Dominating sets in planar graphs: branch-width and exponential speed-up

Download www.ii.uib.no

Fedor V. Fomin, Dimitrios M. Thilikos

Real-time Traffic

Algorithms | SODA 2003 |

claim paper

Related Content

» On Parameterized Exponential Time Complexity

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2003
Where	SODA
Authors	Fedor V. Fomin, Dimitrios M. Thilikos

Comments (0)