Sciweavers

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

8

WADS
2001
Springer

favoriteEmaildiscussreport

106views Algorithms» more WADS 2001»

Small Maximal Independent Sets and Faster Exact Graph Coloring

13 years 9 months ago

Small Maximal Independent Sets and Faster Exact Graph Coloring

Download www.ics.uci.edu

David Eppstein

Real-time Traffic

Algorithms | WADS 2001 |

claim paper

Related Content

» An optimal maximal independent set algorithm for boundedindependence graphs

» RentorBuy Scheduling and Cost Coloring Problems

» Weak graph colorings distributed algorithms and applications

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	WADS
Authors	David Eppstein

Comments (0)