151 search results - page 16 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
194
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
165
click to vote
ADHOCNOW
2004
Springer
15 years 9 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
156
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
131
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
144
click to vote
IANDC
2007
15 years 3 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...