11381 search results - page 109 / 2277 » Connectivity |
115
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we show that for an n-vertex graph G of genus g, the edge expansion of G can be determined in time nO(g2 ) . We show that the same is true for various other similar ...
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider a dynamic server control problem for two parallel queues with randomly varying connectivity and server switchover time between the queues. At each time slot the server...
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The two-terminal reliability, known as the pair connectedness or connectivity function in percolation theory, may actually be expressed as a product of transfer matrices in which t...
DM
2007
15 years 3 months ago
2007
A graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a sequence of l-cycles (3 ≤ l ≤ 4)
107
click to vote
ENDM
2007
15 years 3 months ago
2007
For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not c...