23 search results - page 4 / 5 » A Coarse-Grained Parallel Algorithm for Spanning Tree and Co... |
ICPP
2005
IEEE
13 years 11 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
ACID
2006
13 years 6 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
ICDCSW
2003
IEEE
13 years 10 months ago
2003
IEEE
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...