On distance graph coloring problems-Reference-Cited by-同舟云学术

On distance graph coloring problems

Published:2019-01-21 Issue:3 Volume:28 Page:1213-1241
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

de Freitas Rosiane¹^ORCID,Dias Bruno¹^ORCID,Maculan Nelson²^ORCID,Szwarcfiter Jayme²^ORCID

Affiliation:

1. Programa de Pós‐Graduação em Informática Instituto de Computação Universidade Federal do Amazonas Av. Rodrigo Otávio 3000 69000‐000 Manaus Brazil

2. Programa de Engenharia de Sistemas e Computação COPPE Universidade Federal do Rio de Janeiro C.P. 68530 21945‐970 Rio de Janeiro Brazil

Funder

Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

Fundação de Amparo à Pesquisa do Estado do Amazonas

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12626

Reference23 articles.

1. Feasibility check for the distance geometry problem: an application to molecular conformations

2. A Coloring Problem With Restrictions of Adjacent Colors

3. The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

4. A survey on the channel assignment problem in wireless networks

5. Bordini A. Protti F. da Silva T. Filho G. 2019.New algorithms for the minimum coloring cut problem.International Transactions in Operational Research26 1868–1883.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be?;Computers & Operations Research;2024-08

2. Figures of Graph Partitioning by Counting, Sequence and Layer Matrices;Mathematics;2021-06-18

3. Multiple criteria analysis of the popularity and growth of research and practice of visual analytics, and a forecast of the future trajectory;International Transactions in Operational Research;2021-02-26

4. On the complexity of coloring ‐graphs;International Transactions in Operational Research;2021-01-19

5. Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem;RAIRO - Operations Research;2021