Paper Info
Title
The Vertex Coloring Problem and its generalizations
Abstract
This is a summary of the author’s PhD thesis supervised by Paolo Toth and defended on 29 May 2007 at the Università 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.
Year
DOI
Venue
2009
10.1007/s10288-008-0071-y
4OR
Keywords
DocType
Volume
vertex coloring · graph · mathematical models · heuristics · ad hoc networks · fairness msc classification 2000 05c15 · 05c85,ad hoc network,mathematical model
Journal
7
Issue
ISSN
Citations 
1
1614-2411
11
PageRank 
References 
Authors
0.61
37
1
Name
Order
Citations
PageRank
Enrico Malaguti131221.69