A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version)

Details A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version) A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version)

2009-03-20

arxiv.org/abs/0903.3462v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We address the problem of finding nice labellings for event structures of degree 3. We develop a minimum theory by which we prove that the labelling number of an event structure of degree 3 is bounded by a linear function of the height. The main theorem we present in this paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors. Finally, we exemplify how to use this theorem to construct upper bounds for the labelling number of other event structures of degree 3.

Affiliated with

Also associated with

No associations

Rating

A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version) 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 A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-641731