Parallel \((\Delta +1)\)-coloring of constant-degree graphs
type: Item
instance of: scholarly article
title: Parallel \((\Delta +1)\)-coloring of constant-degree graphs
zbMATH Open document ID: 0653.68068
DOI: 10.1016/0020-0190(87)90169-4
author: Andrew V. Goldberg
author: Serge Plotkin
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4066362
zbMATH Keywords: graph coloring
zbMATH Keywords: parallel algorithms
zbMATH Keywords: maximal independent set
zbMATH Keywords: EREW PRAM
zbMATH Keywords: complexity bounds
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90169-4
OpenAlex ID: W2009524061
cites work: Complexity of network synchronization
cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: A Las Vegas RNC algorithm for maximum matching
description: scientific article; zbMATH DE number 4066362