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 条

[41] Accelerating Ant Colony Optimization for the Vertex Coloring Problem on the GPU
Murooka, Ryouhei
Ito, Yasuaki
Nakano, Koji
[J]. 2016 FOURTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2016, : 469 - 475
[42] When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence
Bujtas, Csilla
Sampathkumar, E.
Tuza, Zsolt
Dominic, Charles
Pushpalatha, L.
[J]. ARS COMBINATORIA, 2016, 128 : 165 - 173
[43] Interval vertex coloring
Macekova, Maria
Sarosiova, Zuzana
Sotak, Roman
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2024, 470
[44] On Buffon's problem and its generalizations
Kac, M
van Kamfen, ER
Wintner, A
[J]. AMERICAN JOURNAL OF MATHEMATICS, 1939, 61 : 672 - 676
[45] Brezis–Marcus Problem and its Generalizations
Avkhadiev F.G.
[J]. Journal of Mathematical Sciences, 2021, 252 (3) : 291 - 301
[46] DNA computing model of graph vertex coloring problem based on microfluidics
Zhang, Xun-Cai
Niu, Ying
Xi, Fang
[J]. Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2013, 43 (01): : 206 - 211
[47] THE EFFECT OF NUMBER OF HAMILTONIAN PATHS ON THE COMPLEXITY OF A VERTEX-COLORING PROBLEM
MANBER, U
TOMPA, M
[J]. SIAM JOURNAL ON COMPUTING, 1984, 13 (01) : 109 - 115
[48] Iterated local search with tabu search for the weighted vertex coloring problem
Nogueira, Bruno
Tavares, Eduardo
Maciel, Paulo
[J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 125
[49] Special issue on computational methods for graph coloring and its generalizations - Preface
Johnson, David S.
Mehrotra, Anuj
Trick, Michael A.
[J]. DISCRETE APPLIED MATHEMATICS, 2008, 156 (02) : 145 - 146
[50] New Bounds and Constraint Programming Models for theWeighted Vertex Coloring Problem
Goudet, Olivier
Grelier, Cyril
Lesaint, David
[J]. PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 1927 - 1934

← 1 2 3 4 5 →