Computer Science – Discrete Mathematics
Scientific paper
2008-12-11
Computer Science
Discrete Mathematics
8 pages, 3 pictures, technical report
Scientific paper
In this paper a greedy algorithm to detect conflict cliques in interval graphs and circular-arc graphs is analyzed. In a graph, a stable set requires that at most one vertex is chosen for each edge. It is equivalent to requiring that at most one vertex for each maximal clique is chosen. We show that this algorithm finds all maximal cliques for interval graphs, i.e. it can compute the convex hull of the stable set polytope. In case of circular-arc graphs, the algorithm is not able to detect all maximal cliques, yet remaining correct. This problem occurs in the context of railway scheduling. A train requests the allocation of a railway infrastructure resource for a specific time interval. As one is looking for conflict-free train schedules, the used resource allocation intervals in a schedule must not overlap. The conflict-free choices of used intervals for each resource correspond to stable sets in the interval graph associated to the allocation time intervals.
Caimi Gabrio
Flier Holger
Fuchsberger Martin
Nunkesser Marc
No associations
LandOfFree
Performance of a greedy algorithm for edge covering by cliques in interval graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Performance of a greedy algorithm for edge covering by cliques in interval graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance of a greedy algorithm for edge covering by cliques in interval graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-60546