user

The Vertex Coloring Problem and its generalizations

被引：11
|
作者：
Malaguti, Enrico [1 ]
机构：
[1] Univ Bologna, DEIS, Bologna, Italy
来源：
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2009年 / 7卷 / 01期
关键词：
Vertex Coloring; Graph; Mathematical Models; Heuristics; Ad hoc networks; Fairness;
D O I：
10.1007/s10288-008-0071-y
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This is a summary of the author's PhD thesis supervised by Paolo Toth and defended on 29 May 2007 at the UniversitA di Bologna. The thesis is written in English and is available from the author upon request. The first part of this work deals with the Vertex Coloring Problem and its generalizations, for which models, bounds and algorithms are proposed. The Second Part is dedicated to a different problem on graphs, namely a Routing Problem in telecommunication networks where not only the efficiency, but also the fairness of the solution is considered.
引用
收藏
页码：101 / 104
页数：4
相关论文
共 50 条
  • [1] The Vertex Coloring Problem and its generalizations
    Enrico Malaguti
    [J]. 4OR, 2009, 7 : 101 - 104
  • [2] Some generalizations of theorems on vertex coloring
    Berlov, S. L.
    Dol'nikov, V. L.
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (07) : 1582 - 1585
  • [3] Uncertain vertex coloring problem
    Chen, Lin
    Peng, Jin
    Ralescu, Dan A.
    [J]. SOFT COMPUTING, 2019, 23 (04) : 1337 - 1346
  • [4] Uncertain vertex coloring problem
    Lin Chen
    Jin Peng
    Dan A. Ralescu
    [J]. Soft Computing, 2019, 23 : 1337 - 1346
  • [5] Polynomial Cases for the Vertex Coloring Problem
    T. Karthick
    Frédéric Maffray
    Lucas Pastor
    [J]. Algorithmica, 2019, 81 : 1053 - 1074
  • [6] A NEW APPROACH TO THE VERTEX COLORING PROBLEM
    Torkestani, Javad Akbari
    [J]. CYBERNETICS AND SYSTEMS, 2013, 44 (05) : 444 - 466
  • [7] An exact approach for the Vertex Coloring Problem
    Malaguti, Enrico
    Monaci, Michele
    Toth, Paolo
    [J]. DISCRETE OPTIMIZATION, 2011, 8 (02) : 174 - 190
  • [8] The Distance Polytope for the Vertex Coloring Problem
    Dias, Bruno
    de Freitas, Rosiane
    Maculan, Nelson
    Marenco, Javier
    [J]. COMBINATORIAL OPTIMIZATION, ISCO 2018, 2018, 10856 : 144 - 156
  • [9] Polynomial Cases for the Vertex Coloring Problem
    Karthick, T.
    Maffray, Frederic
    Pastor, Lucas
    [J]. ALGORITHMICA, 2019, 81 (03) : 1053 - 1074
  • [10] A metaheuristic approach for the vertex coloring problem
    Malaguti, Enrico
    Monaci, Michele
    Toth, Paolo
    [J]. INFORMS JOURNAL ON COMPUTING, 2008, 20 (02) : 302 - 316
12345