13 search results - page 1 / 3 » Lower Bounds for Dynamic Tree Embedding in Bipartite Network... |
JPDC
1998
13 years 7 months ago
1998
SPAA
2004
ACM
14 years 27 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
WINET
2011
13 years 2 months ago
2011
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
COMGEO
2012
ACM
12 years 3 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
INFOCOM
1999
IEEE
13 years 11 months ago
1999
IEEE
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...