On linear-time algorithms for five-coloring planar graphs

Authors:
Greg N. Frederickson
Affiliations:
Purdue Univ., West Lafayette, IN
Venue:
Information Processing Letters
Year:
1984

Citing 0
Cited 2

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
Coloring with defect

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract