137 search results - page 4 / 28 » Locally connected spanning trees on graphs |
VTC
2010
IEEE
14 years 7 months ago
2010
IEEE
—Nonparametric belief propagation (NBP) is one of the best-known methods for cooperative localization in sensor networks. It is capable to provide information about location esti...
72
Voted
FUIN
2007
14 years 9 months ago
2007
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...
108
click to vote
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
SODA
2012
ACM
12 years 12 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...