Sciweavers

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

32

FOCS
1995
IEEE

favoriteEmaildiscussreport

101views Theoretical Computer Science» more FOCS 1995»

Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time

14 years 2 months ago

Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time

Download eprints.iisc.ernet.in

C. R. Subramanian

Real-time Traffic

FOCS 1995 | Theoretical Computer Science |

claim paper

Related Content

» Approximating Independent Set in SemiRandom Graphs

» Coloring Sparse Random kColorable Graphs in Polynomial Expected Time

» On the Minimum Load Coloring Problem

» Sampling Unlabeled Biconnected Planar Graphs

» Computing minimum cuts by randomized search heuristics

» Generating unlabeled connected cubic planar graphs uniformly at random

» Improved Inapproximability Results for Maximum kColorable Subgraph

» New Approaches for Virtual Private Network Design

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	FOCS
Authors	C. R. Subramanian

Comments (0)