151 search results - page 1 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
107
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
204
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
118
click to vote
PODS
2006
ACM
16 years 1 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
115
click to vote
MST
2010
14 years 8 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...