The performance of an upper bound on the fractional chromatic number of weighted graphs
From MaRDI portal
Publication:968556
DOI10.1016/j.aml.2010.02.001zbMath1215.05064arXiv1001.3053MaRDI QIDQ968556
Publication date: 5 May 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.3053
upper bound; distributed systems; fractional chromatic number; weighted graph; worst-case performance; greedy coloring algorithm
Cites Work