On the max-weight edge coloring problem

Author： Lucarelli Giorgio   Milis Ioannis   Paschos Vangelis  

Publisher： Springer Publishing Company

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.20, Iss.4, 2010-11, pp. : 429-442

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On edge orienting methods for graph coloring

By Gendron Bernard   Hertz Alain   St-Louis Patrick  

Journal of Combinatorial Optimization, Vol. 13, Iss. 2, 2007-02 ,pp. : 163-178

Springer Publishing Company

Access to resources Recommend Favorite

Algorithm for the Cost Edge-Coloring of Trees

By Zhou Xiao   Nishizeki Takao  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 97-108

Springer Publishing Company

Access to resources Recommend Favorite

Edge-Coloring Partial k -Trees

By Zhou X.   Nakano S.I.   Nishizeki T.  

Journal of Algorithms, Vol. 21, Iss. 3, 1996-11 ,pp. : 598-617

Academic Press

Access to resources Recommend Favorite

Optimal edge‐coloring with edge rate constraints

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 62, Iss. 3, 2013-10 ,pp. : 165-182

John Wiley & Sons Inc

Access to resources Recommend Favorite

An Upper Bound for Some Coloring Problem

By Januszewski Janusz  

American Mathematical Monthly, Vol. 122, Iss. 5, 2015-05 ,pp. : 481-481

Mathematical Association of America

Access to resources Recommend Favorite