Skip navigation
Skip navigation

Very fast parallel algorithms for approximate edge coloring

Han, Yijie; Liang, Weifa; Shen, Xiaojun

Description

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�

CollectionsANU Research Publications
Date published: 2001
Type: Journal article
URI: http://hdl.handle.net/1885/70997
Source: Discrete Applied Mathematics
DOI: 10.1016/S0166-218X(99)00190-0

Download

File Description SizeFormat Image
01_Han_Very_fast_parallel_algorithms_2001.pdf109.97 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator