The local nature of \(\Delta\)-coloring and its algorithmic applications
type: Item
instance of: scholarly article
title: The local nature of \(\Delta\)-coloring and its algorithmic applications
zbMATH Open document ID: 0837.68043
DOI: 10.1007/BF01200759
author: Alessandro Panconesi
author: Aravind Srinivasan
published in: Combinatorica
publication date: 1996-04-16T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 778337
zbMATH Keywords: coloring
zbMATH Keywords: connected graph
MaRDI profile type: Publication
cites work: Deterministic coin tossing with applications to optimal parallel list ranking
cites work: Parallel Symmetry-Breaking in Sparse Graphs
cites work: Brooks Coloring in Parallel
cites work: A fast parallel algorithm to color a graph with Δ colors
cites work: An NC algorithm for Brooks' theorem
cites work: A fast parallel algorithm for routing in permutation networks
cites work: Locality in Distributed Graph Algorithms
cites work: Removing randomness in parallel computation without a processor penalty
full work available at URL: https://doi.org/10.1007/bf01200759
OpenAlex ID: W2056050680
Recommended article: Locally-iterative Distributed (Δ + 1)-coloring and Applications
Recommended article: Local coloring: new observations and new reductions
Recommended article: Q3070244
Recommended article: A note on local colorings of graphs
Recommended article: A note on local coloring of graphs
Recommended article: On locally-perfect colorings
Recommended article: Local \(k\)-colorings of graphs and hypergraphs
Recommended article: Q3089247
Recommended article: NP-completeness of local colorings of graphs
Recommended article: Q5461691
description: scientific article; zbMATH DE number 778337