scientific article; zbMATH DE number 1424324
From MaRDI portal
Publication:4945538
zbMath0947.68052MaRDI QIDQ4945538
Sridhar Rajagopalan, Prabhakar Raghavan, Monika R. Henzinger
Publication date: 23 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (44)
On finding common neighborhoods in massive graphs. ⋮ An external-memory algorithm for string graph construction ⋮ Finding frequent items in data streams ⋮ Tight lower bounds for query processing on streaming and external memory data ⋮ Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models ⋮ Streaming deletion problems parameterized by vertex cover ⋮ Sublinear Estimation of Weighted Matchings in Dynamic Data Streams ⋮ Efficient optimally lazy algorithms for minimal-interval semantics ⋮ Superlinear lower bounds for multipass graph processing ⋮ Graph Connectivity in Log Steps Using Label Propagation ⋮ Streaming deletion problems Parameterized by vertex cover ⋮ Adapting parallel algorithms to the W-stream model, with applications to graph problems ⋮ A Black Box for Online Approximate Pattern Matching ⋮ Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions ⋮ Weighted matching in the semi-streaming model ⋮ Intractability of min- and max-cut in streaming graphs ⋮ Single Pass Spectral Sparsification in Dynamic Streams ⋮ From approximate balls to approximate ellipses ⋮ Sleeping on the job: energy-efficient and robust broadcast for radio networks ⋮ Unnamed Item ⋮ Streaming techniques and data aggregation in networks of tiny artefacts ⋮ Dynamic graph stream algorithms in \(o(n)\) space ⋮ Streaming pattern matching with \(d\) wildcards ⋮ Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem ⋮ New results for finding common neighborhoods in massive graphs in the data stream model ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ Structural results on matching estimation with applications to streaming ⋮ Streaming algorithm for graph spanners-single pass and constant processing time per edge ⋮ Statistical estimation with bounded memory ⋮ Best-order streaming model ⋮ On-line motif detection in time series with SwiftMotif ⋮ Database query processing using finite cursor machines ⋮ Finding longest increasing and common subsequences in streaming data ⋮ A black box for online approximate pattern matching ⋮ Incremental algorithms for facility location and \(k\)-median ⋮ Faster core-set constructions and data-stream algorithms in fixed dimensions ⋮ A way for low ranking matrices and its stochastic computations using Monte Carlo method ⋮ Sketching information divergences ⋮ Depth First Search in the Semi-streaming Model ⋮ Optimal lower bounds for matching and vertex cover in dynamic graph streams ⋮ Real-Time Streaming Multi-Pattern Search for Constant Alphabet ⋮ Dynamic data structures for timed automata acceptance ⋮ On graph problems in a semi-streaming model ⋮ A greedy algorithm for finding maximum spanning trees in infinite graphs
This page was built for publication:
