Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM
type: Item
instance of: scholarly article
title: Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM
zbMATH Open document ID: 0854.68040
DOI: 10.1016/0166-218X(94)00128-Z
author: G. Sajith
author: Sanjeev Saxena
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 897366
zbMATH Keywords: vertex colouring
MaRDI profile type: Publication
cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem
cites work: Deterministic parallel list ranking
cites work: Q3140396
cites work: A New Parallel Algorithm for the Maximal Independent Set Problem
cites work: Constructing a Maximal Independent Set in Parallel
cites work: Brooks Coloring in Parallel
cites work: A Simpler Parallel Algorithm for Graph Connectivity
cites work: A fast parallel algorithm to color a graph with Δ colors
cites work: A Las Vegas RNC algorithm for maximum matching
cites work: An NC algorithm for Brooks' theorem
cites work: A fast parallel algorithm for the maximal independent set problem
cites work: Q3880849
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
cites work: Removing randomness in parallel computation without a processor penalty
cites work: Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
cites work: Q3907580
description: scientific article; zbMATH DE number 897366