scientific article; zbMATH DE number 3894489

MaRDI QIDQ5186751zbMATH OpenFDO

Authors A. A. Shnejder

Publication date 1984

zbMATH Keywords

comparative analysisefficiency of heuristic algorithmslarge-scale experimental study

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)

Recommendations

• Publication:5752591
• New graph coloring algorithms
• scientific article; zbMATH DE number 3841898
• Numerical experiences with graph coloring algorithms
• Some sequential graph colouring algorithms

Cited in

(3)

• A classifier system using smooth graph coloring
• A wide-ranging computational comparison of high-performance graph colouring algorithms
• New graph coloring algorithms

This page was built for publication:

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