618 search results - page 21 / 124 » Short cycle connectivity |
EUROPAR
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle ar...
DM
1998
13 years 9 months ago
1998
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...
SIAMDM
2010
13 years 4 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
WWIC
2010
Springer
14 years 1 months ago
2010
Springer
Many of the existing multichannel wireless network implementations rely on channel switching capability of the wireless radios to ensure network connectivity. However, due to both ...
JGT
2006
13 years 9 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...