On the complexity of the flow coloring problem-Reference-Cited by-同舟云学术

On the complexity of the flow coloring problem

Published:2015-12 Issue: Volume:197 Page:75-92
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Campêlo Manoel,Huiban Cristiana^ORCID,Rodrigues Carlos Diego,Sampaio Rudini M.^ORCID

Funder

Capes

CNPq

CNPq/Funcap

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference19 articles.

1. C. Barrett, G. Istrate, V. Kumar, M. Marathe, S. Thite, S. Thulasidasan, Strong edge coloring for channel assignment in wireless radio networks. In IEEE conf. Pervasive and Communications Workshops, pages 106–110, 2006.

2. Hardness and approximation of gathering in static radio networks;Bermond;Parallel Process. Lett.,2006

3. Round weighting problem and gathering in wireless networks with symmetrical interference;Bermond,2009

4. M. Campêlo, R. Corrêa, C.G. Huiban, D. Rodrigues, The flow coloring problem. in: Congreso Latino-Iberoamericano de Investigacion Operativa, CLAIO, SBPO, pages 3256–3267, RJ, Brazil, September 2012.

5. Graph Theory;Diestel,2005

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

1. A strongly polynomial algorithm for the minimum maximum flow degree problem;Operations Research Letters;2023-01

2. Using the minimum maximum flow degree to approximate the flow coloring problem;Annals of Operations Research;2021-06-30

3. Round weighting problem and gathering in radio networks with symmetrical interference;Discrete Mathematics, Algorithms and Applications;2016-05-26

4. Preface;Discrete Applied Mathematics;2015-12