k L-list τ colouring of graphs

The k L-list tau coloring of a graph G is an L-list coloring (with positive integers) where any 2 colors assigned to adjacent vertices do not belong to a set tau, where the avoided assignments are listed. Moreover, the length of the list L(x), for every vertex x of G, must be less than or equal to a...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 106; no. 1; pp. 160 - 164
Main Authors DE LUCA CARDILLO, D, MIONE, N
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier 01.04.1998
Elsevier Sequoia S.A
Subjects
Algorithms
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Operational research and scientific management
Operational research. Management science
Scheduling
Studies
Railway
Heuristic method
Graph colouring
NP complete problem
Scheduling
Graph theory
Algorithm
Train
Online AccessGet full text

Cover

More Information
Summary:The k L-list tau coloring of a graph G is an L-list coloring (with positive integers) where any 2 colors assigned to adjacent vertices do not belong to a set tau, where the avoided assignments are listed. Moreover, the length of the list L(x), for every vertex x of G, must be less than or equal to a positive integer k, where k is the number of colors. This problem is NP-complete and an efficient heuristic algorithm is presented to solve it. A fundamental aspect of the algorithm is a particular technique of backtracking that permits the direct reassignment of the vertices causing the conflict if, at the moment of assigning a color to a vertex, no color on the list associated to it is available. An application of this algorithm to the problem of assigning arriving or leaving trains to the available tracks at a railway station is also discussed.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(98)00299-9