COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph spanners in the streaming model: An experimental study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Stretch Spanners on Dynamic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small stretch \((\alpha ,\beta )\)-spanners in the streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming algorithm for graph spanners-single pass and constant processing time per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable searching problems I. Static-to-dynamic transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting with limited storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of minimum spanner problems / rank
 
Normal rank

Latest revision as of 21:25, 3 July 2024

scientific article
Language Label Description Also known as
English
COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references