Very fast parallel algorithms for approximate edge coloring
type: Item
instance of: scholarly article
title: Very fast parallel algorithms for approximate edge coloring
zbMATH Open document ID: 0967.68120
DOI: 10.1016/S0166-218X(99)00190-0
author: Yijie Han
author: W. Liang
author: Xiaojun Shen
published in: Discrete Applied Mathematics
publication date: 2001-09-03T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1584593
zbMATH Keywords: fast parallel algorithms
zbMATH Keywords: edge coloring
MaRDI profile type: MaRDI publication profile
cites work: Simulating (log c n )-wise independence in NC
cites work: Q5501805
cites work: The NP-Completeness of Edge-Coloring
cites work: Q4023519
cites work: Efficient parallel algorithms for edge coloring problems
cites work: Parallel algorithms for the edge-coloring and edge-coloring update problems
cites work: A constructive proof of Vizing's theorem
cites work: The probabilistic method yields deterministic parallel algorithms
full work available at URL: s0166-218x(99)00190-0
OpenAlex ID: W2035522910
Wikidata QID: Q127724271
Recommended article: Q4250737
Recommended article: Efficient parallel algorithms for edge coloring problems
Recommended article: Q3785972
Recommended article: Fast parallel edge colouring of graphs.
Recommended article: Q3806831
Recommended article: Q3708831
Recommended article: Q3783598
Recommended article: Q5075750
Recommended article: Q4694726
Recommended article: Parallel algorithms for the edge-coloring and edge-coloring update problems
description: scientific article; zbMATH DE number 1584593