𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classification analysis of heuristic algorithms for graph coloring

✍ Scribed by A. A. Shneider

Publisher
Springer US
Year
1984
Tongue
English
Weight
958 KB
Volume
20
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel Heuristics for Improved, Balanc
Parallel Heuristics for Improved, Balanced Graph Colorings
✍ Robert K. Gjertsen; Jr.; Mark T. Jones; Paul E. Plassmann πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 399 KB

The computation of good, balanced graph colorings is an essential part of many algorithms required in scientific and engineering applications. Motivated by an effective sequential heuristic, we introduce a new parallel heuristic, PLF, and show that this heuristic has the same expected runtime under

Neural network-based heuristic algorithm
Neural network-based heuristic algorithms for hypergraph coloring problems with applications
✍ Dmitri Kaznachey; Arun Jagota; Sajal Das πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 283 KB

The graph coloring problem is a classic one in combinatorial optimization with a diverse set of significant applications in science and engineering. In this paper, we study several versions of this problem generalized to hypergraphs and develop solutions based on the neural network approach. We expe