On distance graph coloring problems

DOI10.1111/itor.12626OpenAlexW2914710290MaRDI QIDQ6070499

Nelson F. Maculan, Jayme Luiz Szwarcfiter, Rosiane de Freitas, Bruno H. Dias

Publication date: 21 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12626

zbMATH Keywords

algorithmscomputational complexitygraph theorydistance geometrybandwidth coloringT-coloring

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

On the complexity of coloring ‐graphs ⋮ Multiple criteria analysis of the popularity and growth of research and practice of visual analytics, and a forecast of the future trajectory

Cites Work

• Multistart iterated tabu search for bandwidth coloring problem
• The discretizable molecular distance geometry problem
• Graphs and algorithms in communication networks. Studies in broadband, optical, wireless and ad hoc networks
• The discretizable distance geometry problem
• Recent advances on the discretizable molecular distance geometry problem
• Optimal partial discretization orders for discretizable distance geometry
• Distance Geometry
• A survey on vertex coloring problems
• A Coloring Problem With Restrictions of Adjacent Colors
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Reducibility among Combinatorial Problems
• Feasibility check for the distance geometry problem: an application to molecular conformations
• Euclidean Distance Geometry and Applications
• New algorithms for the minimum coloring cut problem

This page was built for publication: On distance graph coloring problems