Very fast parallel algorithms for approximate edge coloring

  • Han Y
  • Liang W
  • Shen X
  • 3

    Readers

    Mendeley users who have this article in their library.
  • 2

    Citations

    Citations of this article.

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

Author-supplied keywords

  • Analysis of algorithms
  • Edge coloring
  • Graph algorithms
  • PRAM
  • Parallel algorithms

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Yijie Han

  • Weifa Liang

  • Xiaojun Shen

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free