Circular permutation graph family with applications
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Discrete Applied Mathematics
On the performance of the First-Fit coloring algorithm on permutation graphs
Information Processing Letters
On the k-Colouring of Circle-Graphs
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
The mutual exclusion scheduling problem for permutation and comparability graphs
Information and Computation
Dispatching Buses in Parking Depots
Transportation Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Discrete Applied Mathematics
Plane drawings of queue and deque graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Routing Trains Through Railway Junctions: A New Set-Packing Approach
Transportation Science
Railway track allocation: models and methods
OR Spectrum
On the online track assignment problem
Discrete Applied Mathematics
Distance-hereditary comparability graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider a station in which several trains might stop at the same track at the same time. The trains might enter and leave the station from both sides, but the arrival and departure times and directions are fixed according to a given time table. The problem is to assign tracks to the trains such that they can enter and leave the station on time without being blocked by any other train. We consider some variation of the problem on linear time tables as well as on cyclic time tables and show how to solve them as a graph coloring problem on special graph classes. One of these classes are the so called circular arc containment graphs for which we give an optimal O(nlogn) coloring algorithm.