A Nice Labelling for Tree-Like Event Structures of Degree 3
| dc.creator | Santocanale, Luigi | |
| dc.date | 2007-04-18 | |
| dc.date.accessioned | 2026-07-07T07:57:02Z | |
| dc.date.available | 2026-07-07T07:57:02Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0704.2355 | |
| dc.identifier | http://arxiv.org/abs/0704.2355 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/127534 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.title | A Nice Labelling for Tree-Like Event Structures of Degree 3 | |
| dc.type | text |