Distance-constrained grid colouring

DOI10.1515/AUSI-2016-0001MaRDI QIDQ2629563zbMATH OpenOpenAlexFDO

Authors László Aszalós, Mária Bakó

Publication date 6 July 2016

Published in Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.1515/ausi-2016-0001

zbMATH Keywords

constraint logic programmingmin-conflicts method

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Programming involving graphs or networks (90C35) Mathematical programming (90C99)

Recommendations

• Bounds for the frequency assignment problem
• Ordered coloring grids and related graphs
• Distance graphs and the T-coloring problem
• APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
• scientific article; zbMATH DE number 4065018

Cites work

• A survey on radio \(k\)-colorings of graphs
• Hybrid evolutionary algorithms for graph coloring
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems

Cited in

(2)

• scientific article; zbMATH DE number 1735785 (Why is no real title available?)
• Notes on models for distance coloring problems

This page was built for publication: Distance-constrained grid colouring

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