151 search results - page 8 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
212
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
120
click to vote
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
— Recently power becomes a significant issue in clock network design for high-performance ICs because the clock network consumes a large portion of the total power in the whole s...
188
click to vote
WAW
2010
Springer
15 years 1 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
158
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
109
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...