ALGORITHMICA 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ALGORITHMICA-2008 Paper

click to vote

ALGORITHMICA
2008

142views more ALGORITHMICA 2008»

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

13 years 5 months ago

Download cs.nyu.edu

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

claim paper

Read More »

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.

Id	Views	Title	Status

1	142	New Linear-Time Algorithms for Edge-Coloring Planar Graphs	claim
2	131	Sorting and Searching in Faulty Memories	claim
3	121	Space Efficient Algorithms for Ordered Tree Comparison	claim
4	115	Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection	claim
5	111	Fixed-Parameter Complexity of Minimum Profile Problems	claim
6	110	Bandwidth-Constrained Allocation in Grid Computing	claim
7	95	On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms	claim
8	95	Optimality in External Memory Hashing	claim
9	91	Average Case Analysis of Bounded Space Bin Packing Algorithms	claim
10	88	Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings	claim
11	83	Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs	claim
12	82	Random Bichromatic Matchings	claim
13	79	Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets	claim
14	78	Optimally Adaptive Integration of Univariate Lipschitz Functions	claim
15	72	Treewidth Lower Bounds with Brambles	claim
16	71	Improved Approximate String Matching Using Compressed Suffix Data Structures	claim
17	67	Introduction to Special Issue	claim
18	63	The Swap Edges of a Multiple-Sources Routing Tree	claim
19	63	Incremental Medians via Online Bidding	claim
20	59	An Optimal Algorithm for the Minimum Disc Cover Problem	claim
21	56	Eliminating Cycles in the Discrete Torus	claim
22	53	The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms	claim
23	52	From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time	claim
24	50	Approximation Algorithms for Bounded Degree Phylogenetic Roots	claim
25	48	On the Stability of Dynamic Diffusion Load Balancing	claim
26	46	A Network Game with Attackers and a Defender	claim
27	43	Gaussian Laws for the Main Parameters of the Euclid Algorithms	claim
28	42	Solving Connected Dominating Set Faster than 2 n	claim
29	36	Algorithms for Modular Counting of Roots of Multivariate Polynomials	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers