241 search results - page 40 / 49 » Degree Bounded Spanning Trees |
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
SECON
2008
IEEE
14 years 1 months ago
2008
IEEE
— What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using real...
SWAT
1992
Springer
13 years 11 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
STOC
1996
ACM
13 years 11 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
IPPS
2005
IEEE
14 years 29 days 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...