Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-005-0147-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056518357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Time Construction of Sparse Neighborhood Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with Polynomial Communication-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding common neighborhoods in massive graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEW SPARSENESS RESULTS ON GRAPH SPANNERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better streaming algorithms for clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog-time and near-linear work approximation scheme for undirected shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Small-Stretch Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>(1 + εΒ)</i> -spanner constructions for general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate <i>L</i><sup>1</sup> -Difference Algorithm for Massive Data Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths for graphs with small integer length edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between space and efficiency for routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the all-pairs-shortest-path problem in unweighted undirected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796165 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:25, 6 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
scientific article

    Statements

    Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (English)
    0 references
    0 references
    0 references
    13 June 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    spanner
    0 references
    almost shortest paths
    0 references
    streaming model
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references