A T-coloring algorithm based on multiagent evolution

MaRDI QIDQ3054217zbMATH OpenFDO

Authors Jinshu Li, Jing Liu, Kang Hu, Jingrun Wang, Licheng Jiao

Publication date 5 November 2010

zbMATH Keywords

agentevolutionary algorithmfrequency assignment problemT-coloring problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Recommendations

• Graph coloring by multiagent fusion search
• An evolutionary approach for bandwidth multicoloring problems
• scientific article; zbMATH DE number 1342294
• APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
• On the use of some known methods for \(T\)-colorings of graphs

Cited in

(1)

• An evolutionary algorithm based on the four-color theorem for location area planning

This page was built for publication: A T-coloring algorithm based on multiagent evolution

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