Graph coloring in J: an introduction

Authors:
Howard A. Peelle
Affiliations:
University of Massachusetts, Amherst, MA
Venue:
Proceedings of the 2001 conference on APL: an arrays odyssey
Year:
2000

Citing 5
Cited 0

Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Exact coloring of real-life graphs is easy

DAC '97 Proceedings of the 34th annual Design Automation Conference
Using node merging to enhance graph coloring

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
New methods to color the vertices of a graph

Communications of the ACM
Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fundamentals of graph coloring are introduced, and four basic alternative algorithms for coloring undirected graphs are described in J, along with programs for generating, adjacency matrices and testing them. Results are compared, and suggestions for future development are offered.