This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. J. Cole, “The preparation of examination time-tables using a small store computers,” Comput. J., 117–121 (1964).
D. J. A. Welsh and N. B. Powell, “An upper bound for the chromatic number of a graph and its application to timetabling problems,” Comput. J.,10, 85–86 (1967).
D. C. Wood, “A technique for coloring a graph applicable to large scale timetabling pfoblems,” Comput. J., No. 12, 317–319 (1969).
A. P. Ershov, Introduction to Theoretical Programming [in Russian], Nauka, Moscow (1977).
M. R. Garey and D. S. Johnson, Computers and Hard to Solve Problems [Russian translation], Mir, Moscow (1982).
M. R. Garey and D. S. Johnson, “The complexity of near optimal graph coloring,” J. ACM,23, No. 1, 43–49 (1976).
V. A. Evstigneev, Application of Graph Theory to Programming [in Russian], Nauka, Moscow (1985).
A. A. Shneider, “Classification and analysis of heuristic algorithms for coloring vertices of graphs,” Kibernetika, No. 4, 15–22 (1984)
Yu. I. Zhuravlev, “Local algorithms for the evaluation of information,” Kibernetika, No. 1, 12–19 (1985).
Yu. I. Zhuravlev, “Algorithms for the construction of minimal disjoint normal forms for functions of the algebra of the logic,” in: Discrete Mathematics and Mathematical Questions of Cybernetics [in Russian], Vol. 1, Nauka, Moscow (1974), pp. 67–98.
A. V. Anisimov, “Heuristic algorithms for coloring graphs,” in: Seventh All-Union Conference “Problems of Theoretical Cybernetics,” Abstracts of Reports [in Russian], Irkutsk (1985), pp. 10–11.
A. P. Ershov and G. I. Kozhukhin, “Estimates of the chromatic number of connected graphs,” Dokl. Akad. Nauk SSSR,142, No. 2, 270–273 (1962).
A. A. Bul'onkova, “Approximate algorithm for coloring large graphs,” in: Problems of Theoretical and Systematic Programming [in Russian], NGU, Novosibirsk (1982), pp. 81–86.
N. Christophides, Theory of Graphs. Algorithmic Approach [Russian translation], Mir, Moscow (1978).
D. Brelaz, “New methods to color the vertices of a graph,” Comm. ACM,22, No. 4, 251–256 (1979).
H. Papadimitriu and K. Steiglitz, Combinatorial Optimization [Russian translation], Hir, Moscow (1985).
R. E. Tarjan, “Depth first search and linear graph algorithms,” SIAM J. Comput.,1, No. 2, 146–160 (1972).
S. Owicki and D. Gries, “An axiomatic proof technique for parallel programs,” Acta Inform.,6, 319–340 (1976).
V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Theory of data structures and synchronous parallel computations,” Kibernetika, No. 6, 2–15 (1976).
A. V. Anisimov, “Locally finite properties of data structures and their evaluations,” Kibernetika, No. 6, 1–9 (1983).
Additional information
Translated from Kibernetika, No. 6, pp. 1–8, November–December, 1986.
Rights and permissions
About this article
Cite this article
Anisimov, A.V. Local optimization of colorings of graphs. Cybern Syst Anal 22, 683–692 (1986). https://doi.org/10.1007/BF01068683
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068683