Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Parallel approximate undirected shortest paths via low hop emulators / 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: Fast Approximate Shortest Paths in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract) / 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: Exponentially Faster Shortest Paths in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed exact shortest paths in sublinear time / 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: Near-Optimal Distributed Routing with Low Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths / 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: Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sorting in O(nloglogn) time and linear space / 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: A Randomized Parallel Algorithm for Single-Source Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation and conflicts in memory access / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parallel algorithm for approximate shortest path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps / 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 distance computation and routing with small messages / 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: Max flows in O(nm) time, or better / 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: Finding the maximum, merging, and sorting in a parallel computation model / 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

Latest revision as of 10:15, 30 July 2024

scientific article
Language Label Description Also known as
English
Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
scientific article

    Statements

    Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (English)
    0 references
    0 references
    0 references
    14 October 2022
    0 references
    0 references
    0 references

    Identifiers