2503 search results - page 223 / 501 » A study of 3-arc graphs |
158
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
167
click to vote
SBMF
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In the context of the EU project Mobius on Proof Carrying Code for Java programs (midlets) on mobile devices, we present a way to express midlet navigation graphs in JML....
178
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
173
click to vote
ERCIMDL
2010
Springer
15 years 7 months ago
2010
Springer
Invenio is the web-based integrated digital library system developed at CERN. Within this framework, we present four types of ranking models based on the citation graph that comple...
188
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...