Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0708.4284

Optimal Per-Edge Processing Times in the Semi-Streaming Model

Mariano Zelke
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tasks. The semi-streaming model, which is appropriate when dealing with massive graphs, forbids random access to the input and restricts the memory to O(n*polylog n) bits. Particularly, the formerly best per-edge processing times for finding the connected components and a bipartition are O(alpha(n)), for determining k-vertex and k-edge connectivity O(k^2n) and O(n*log n) respectively for any constant k and for computing a minimum spanning forest O(log n). All these time bounds we reduce to O(1). Every presented algorithm determines a solution asymptotically as fast as the best corresponding algorithm up to date in the classical RAM model, which therefore cannot convert the advantage of unlimited memory and random access into superior computing times for these problems.

Explore related subjects

cs.DMcs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mariano Zelke. 2007-08-31. Optimal Per-Edge Processing Times in the Semi-Streaming Model. https://arxiv.org/abs/0708.4284

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Near-optimal edge partitioning via intersecting families

We study the problem of edge partitioning, where the goal is to partition the edge set of a graph into $k$ parts. The replication factor of a vertex $v$ is the number of parts that contain edges incident to $v$. The goal is to minimize the average replication factor of the vertices while keeping the sizes of the parts nearly equal. We study the regime where the number of parts is significantly smaller than the size of the graph. To this end, we prove asymptotically tight bounds on the optimal replication factor, both for any constant number of parts $k$ and when $k$ grows slowly with the number of vertices. In particular, for growing $k$, every graph admits an almost balanced partition with average replication factor $\sqrt{k}(1+o(1))$, and this bound is tight. The upper bounds are achieved by a new class of edge partitioning algorithms. These algorithms are computationally efficient, including in the LOCAL and CONGEST models, and can be implemented as stateless streaming algorithms in graph processing frameworks. The lower bounds are witnessed by complete graphs and by jumbled graphs, also known as pseudo-random graphs. Our method generalizes a family of algorithms based on symmetric intersecting families of sets. Informally, we replace the symmetry condition by a weaker balance condition that is still sufficient for the algorithms. This relaxation makes it possible to construct such families with asymptotically optimal rank $\sqrt{k}(1+o(1))$.

cs.DM↗
arXiv2026

Oblivious Self-Distance Symmetric Rendezvous on the Integer Line

Symmetric rendezvous on the line is a search problem in which two agents, initially placed at distance $2d$, must follow the same randomized strategy to meet as quickly as possible. In the standard model, agents may condition their actions on the entire execution history, and both the known- and unknown-distance variants admit expected rendezvous time $Θ(d)$. We study the role of memory by introducing oblivious self-distance strategies, in which an agent's decision depends only on her position relative to her own starting location. For an initial separation of $2d$, let $R_d$ denote the optimal oblivious expected rendezvous time in the known-distance setting. We develop two finite-state frameworks based on absorbing Markov chains. Truncated chains give computable upper bounds through finite-support strategies, while weak-peek chains give lower bounds through a revealed-information relaxation. Together, they provide a mechanism for certifying optimality. Using that mechanism, we determine $R_1$ exactly and prove that it is attained by a finite-support strategy. For $d=2,\ldots,6$, numerical optimization gives the same truncation structure and objective values, yielding rigorous upper bounds below $7.83d^2$. We do not prove that the computed weak-peek minimizers are global, but the stability of the computations leads us to conjecture that they are, in which case the corresponding truncated strategies are optimal. We also prove that $R_d=Θ(d^2)$. In the unknown-distance setting, we construct a universal strategy, independent of $d$, with expected rendezvous time $O(d^{2+η})$ for every fixed $η>0$. Thus, under the memory restriction, the known-distance rendezvous time becomes quadratic, while near-quadratic performance remains possible even without knowing $d$. The asymptotic analysis uses birth-death Markov chains and their electrical-network interpretation.

cs.DM↗
arXiv2026

The Reach of Abelian Covers in Hypergraphs

Covers in hypergraphs are frequently studied to capture various forms of dependence between hyperedges. For example, even covers--which check if each vertex appears in an even number of hyperedges--have found much success recently in the study of locally decodable codes. Inspired by a recently-emerging line of work on the non-redundancy of constraint satisfaction problems (CSPs), we introduce and study two novel families of covers of hypergraphs which are stricter than even covers: \emph{Abelian} covers and Catalan covers. Abelian covers are similar to even covers, except that arithmetic is now done over the integers rather than modulo 2, allowing us to capture dependences over arbitrary Abelian groups. Catalan covers capture the behavior of non-Abelian groups by only allowing local cancellations in a sequence of hyperedges. We prove three main results about Abelian and Catalan covers. First, using tools from lattice theory, we show that any $r$-uniform hypergraph with $n$ vertices and $n \log(r)$ hyperedges has an Abelian cover. Second, using tools from algebraic topology, we show that in any $3$-uniform hypergraph, Abelian covers and Catalan covers are equivalent; thereby showing that Catalan covers emerge after $O(n)$ hyperedges in $3$-uniform hypergraphs. Finally, using the theory of nilpotent groups, we show that there exists a $4$-uniform hypergraph which has an Abelian cover but not a Catalan cover. Collectively, these results exactly characterize the reach that Abelian covers have in deducing dependences in hypergraphs. As our primary application, we show that any arity-$3$ CSP with an infinite-domain Mal'tsev extension has linear non-redundancy. This implies near optimal streaming, sparsification, and kernelization algorithms for this family of CSPs. Previously, such a result was only known for the much simpler case of arity-$2$ CSPs.

cs.DM↗