Sciweavers

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

106

SODA
1992
ACM

96views Algorithms» more SODA 1992»

Lower Bounds for On-Line Graph Coloring

15 years 3 months ago

Lower Bounds for On-Line Graph Coloring

Download www.tcs.fudan.edu.cn

Magnús M. Halldórsson, Mario Szegedy

Real-time Traffic

Algorithms | SODA 1992 |

claim paper

Related Content

» Optimal OnLine Colorings for Minimizing the Number of ADMs in Optical Networks

» OnLine Steiner Trees in the Euclidean Plane

» Efficient Handoff Rerouting Algorithms A Competitive OnLine Algorithmic Approach

» A Lower Bound for Testing 3Colorability in BoundedDegree Graphs

» Graph uniquemaximum and conflictfree colorings

» On the Acyclic Chromatic Number of Hamming Graphs

» Strong Colorings of Hypergraphs

» Online Interval Coloring and Variants

» Location Oblivious Distributed Unit Disk Graph Coloring

Post Info
More Details (n/a)

Added	07 Nov 2010
Updated	07 Nov 2010
Type	Conference
Year	1992
Where	SODA
Authors	Magnús M. Halldórsson, Mario Szegedy

Comments (0)