Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Hierarchy of Lower Bounds for Sublinear Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small hop-diameter sparse spanners for doubling metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Selective Path-Doubling for Parallel Shortest-Path Computations / 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: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Efficient Distributed Construction of Near Optimal Routing Schemes / 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: $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs / 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: Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic almost-tight distributed algorithm for approximating single-source shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thorup-Zwick emulators are universally optimal hopsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Parallel Algorithm for Single-Source Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Partial Distance Estimation and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation algorithms for weighted shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time–Work Tradeoffs of the Single-Source Shortest Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners and emulators with sublinear distance errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Probability Parallel Transitive-Closure Algorithms / rank
 
Normal rank

Revision as of 10:34, 20 July 2024

scientific article; zbMATH DE number 7105237
Language Label Description Also known as
English
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
scientific article; zbMATH DE number 7105237

    Statements

    Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (English)
    0 references
    0 references
    0 references
    16 September 2019
    0 references
    hopset
    0 references
    shortest path
    0 references
    graph algorithms
    0 references
    0 references
    0 references

    Identifiers