Local optimization of colorings of graphs

DOI10.1007/BF01068683zbMATH Open0639.68060MaRDI QIDQ3780451FDOQ3780451

Authors: Anatoly V. Anisimov 

Publication date: 1986

Published in: Cybernetics (Search for Journal in Brave)

Recommendations

• Publication:4206748
• CHECKCOL: improved local search for graph coloring
• On graph coloring in a class of parallel local algorithms
• Publication:5752591
• scientific article; zbMATH DE number 4134072

zbMATH Keywords

heuristic nondeterministic graph coloring algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Depth-First Search and Linear Graph Algorithms
• New methods to color the vertices of a graph
• Title not available (Why is that?)
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• An axiomatic proof technique for parallel programs
• The preparation of examination time-tables using a small-store computer
• The Complexity of Near-Optimal Graph Coloring
• Title not available (Why is that?)
• A technique for colouring a graph applicable to large scale timetabling problems

Cited In (17)

• Coloring graphs by iterated local search traversing feasible and infeasible solutions
• Generalised graph colouring by a hybrid of local search and constraint programming
• On graph coloring in a class of parallel local algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• A range-compaction heuristic for graph coloring
• Graph Coloring Using Eigenvalue Decomposition
• Title not available (Why is that?)
• Methods of local optimization for the problem of permutating bipartite graphs
• Simple decentralized graph coloring
• A Large Neighborhood Search Heuristic for Graph Coloring
• Local Algorithms for Edge Colorings in UDGs
• A new vertex coloring heuristic and corresponding chromatic number
• Title not available (Why is that?)
• CHECKCOL: improved local search for graph coloring
• Three algorithms for graph locally harmonious colouring
• Local optima topology for the \(k\)-coloring problem

This page was built for publication: Local optimization of colorings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780451)