881 search results - page 6 / 177 » connection 2004 |
IPSN
2004
Springer
14 years 3 months ago
2004
Springer
ICWN
2004
13 years 11 months ago
2004
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
TNC
2004
13 years 11 months ago
2004
To engage Internet2 users in an exploration of peer-to-peer, real-time communications, these users require connectivity. Superior networking connectivity alone is not sufficient. ...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v V (G). The pur...