335 search results - page 12 / 67 » How to Use Spanning Trees to Navigate in Graphs |
111
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
WINET
2010
14 years 10 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
115
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
137
click to vote
GD
1998
Springer
15 years 4 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
104
click to vote
IJCM
2002
14 years 11 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...