Sciweavers

1545 search results - page 3 / 309
» On tree congestion of graphs
Sort
View
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
14 years 6 days ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
SPAA
2003
ACM
14 years 4 months ago
A polynomial-time tree decomposition to minimize congestion
Chris Harrelson, Kirsten Hildrum, Satish Rao
ADHOCNOW
2005
Springer
14 years 4 months ago
Performance Analysis of the Hierarchical Layer Graph for Wireless Networks
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
Stefan Rührup, Christian Schindelhauer, Klaus...
ALGORITHMICA
2007
80views more  ALGORITHMICA 2007»
13 years 11 months ago
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
Andreas Brandstädt, Feodor F. Dragan, Ho&agra...
ISPD
2004
ACM
92views Hardware» more  ISPD 2004»
14 years 4 months ago
A predictive distributed congestion metric and its application to technology mapping
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
Rupesh S. Shelar, Sachin S. Sapatnekar, Prashant S...