Location-oblivious distributed unit disk graph coloring
type: Item
instance of: scholarly article
title: Location-oblivious distributed unit disk graph coloring
zbMATH Open document ID: 1215.68167
author: Michel Barbeau
author: Prosenjit Bose
author: Paz Carmi
author: M. Couture
author: Evangelos Kranakis
published in: Algorithmica
publication date: 2011-05-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5886426
zbMATH Keywords: coloring
zbMATH Keywords: unit disk graph
zbMATH Keywords: approximation algorithms
zbMATH Keywords: distributed algorithms
zbMATH Keywords: location-oblivious algorithms
MaRDI profile type: Publication
full work available at URL: s00453-009-9334-z
OpenAlex ID: W2091923232
cites work: Unit disk graph recognition is NP-hard
cites work: Independence and Coloring Problems on Intersection Graphs of Disks
cites work: On coloring unit disk graphs
cites work: Simple heuristics for unit disk graphs
cites work: Smallest-last ordering and clustering and graph coloring algorithms
cites work: Robust algorithms for restricted domains
cites work: Design and Analysis of Distributed Algorithms
cites work: The on-line first-fit algorithm for radio frequency assignment problems.
DOI: 10.1007/S00453-009-9334-Z
description: scientific article; zbMATH DE number 5886426