13 search results - page 1 / 3 » Lexicographic products in metarouting |
87
Voted
ICNP
2007
IEEE
15 years 6 months ago
2007
IEEE
— Routing protocols often keep track of multiple route metrics, where some metrics are more important than others. Route selection is then based on lexicographic comparison: the ...
82
Voted
DM
2010
14 years 11 months ago
2010
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...
DM
1998
14 years 11 months ago
1998
LREC
2010
15 years 1 months ago
2010
This paper introduces a new lexicographic resource, the MuLeXFoR database, which aims to present word-formation processes in a multilingual environment. Morphological items repres...
DM
2008
14 years 11 months ago
2008
A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...