Very fast parallel algorithms for approximate edge coloring

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n=logn,log(k)n=log(log(k-1)n), and log*(n)=min{k|log(k)n<1}. It is shown that a graph with n vertices and m edges can be edge colored with (2⌈log1/4log*(n)⌉)c·(⌈Δ/logc/4log*(n)⌉)2colors in O(loglog*(n)) time using O(m+n) processors on the EREW PRAM, where Δ is the maximum vertex degree of the graph and c is an arbitrarily large constant. It is also shown that the graph can be edge colored using at most ⌈4Δ1+4/logloglog*(Δ)log1/2log*(Δ)⌉ colors in O(logΔloglog*(Δ)/logloglog*(Δ)+loglog*(n)) time using O(m+n) processors on the same model. © 2001 Elsevier Science B.V.

Cite

CITATION STYLE

APA

Han, Y., Liang, W., & Shen, X. (2001). Very fast parallel algorithms for approximate edge coloring. Discrete Applied Mathematics, 108(3), 227–238. https://doi.org/10.1016/S0166-218X(99)00190-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free