151 search results - page 14 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
163
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
158
click to vote
RSA
2011
14 years 11 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
156
click to vote
ISSS
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
132
Voted
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
126
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...