A fast parallel coloring of planar graphs with five colors

Authors:
Joseph (Seffi) Naor
Affiliations:
The Hebrew Univ. of Jerusalem, Jerusalem, Israel
Venue:
Information Processing Letters
Year:
1987

Citing 0
Cited 3

An efficient parallel algorithm for computing a large independent set in a plan graph

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Graph coloring on coarse grained multicomputers

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Graph coloring on coarse grained multicomputers

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract