An Algorithm for the Chromatic Number of a Graph

Authors:
Chung C. Wang
Affiliations:
Department of Computer Science, University of Kentucky, 915 Office tower, Lexington, KY and State University of New York at Buffalo, Amherst, New York
Venue:
Journal of the ACM (JACM)
Year:
1974

Citing 1
Cited 2

Corrections to Bierstone's Algorithm for Generating Cliques

Journal of the ACM (JACM)

Performance modeling of a partitionable circular bus network for distributed systems

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
PCBN: A High-Performance Partitionable Circular Bus Network for Distributed Systems

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Christofides' algorithm for finding the chromatic number of a graph is improved both in speed and memory space by using a depth-first search rule to search for a shortest path in a reduced subgraph tree.