Sciweavers

Share
ALGORITHMICA   2008
Wall of Fame | Most Viewed ALGORITHMICA-2008 Paper
ALGORITHMICA
2008
142views more  ALGORITHMICA 2008»
9 years 6 months ago
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...
Richard Cole, Lukasz Kowalik
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source142
2Download preprint from source131
3Download preprint from source121
4Download preprint from source115
5Download preprint from source111
6Download preprint from source110
7Download preprint from source95
8Download preprint from source95
9Download preprint from source91
10Download preprint from source88
11Download preprint from source83
12Download preprint from source82
13Download preprint from source79
14Download preprint from source78
15Download preprint from source72
16Download preprint from source71
17Download preprint from source67
18Download preprint from source63
19Download preprint from source63
20Download preprint from source59
21Download preprint from source56
22Download preprint from source53
23Download preprint from source52
24Download preprint from source50
25Download preprint from source48
26Download preprint from source46
27Download preprint from source43
28Download preprint from source42
29Download preprint from source36
books