Fault-tolerant approximate shortest-path trees (Q1799205): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1407.0637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING / rank
 
Normal rank
Property / cites work
 
Property / cites work: On resilient graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive spanners and (α, β)-spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nearly optimal oracle for avoiding failed vertices and edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Purely Additive Fault-Tolerant Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact and Fast Sensitivity Oracles for Single-Source Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-edge-fault-tolerant approximate shortest-path trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerant Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant spanners for general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: f-Sensitivity Distance Oracles and Routing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Pairwise Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Fault-Tolerant Approximate Shortest-Path Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles for Distances Avoiding a Failed Node or Link / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for 2-edge-connectivity augmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the most vital node of a shortest path. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex fault tolerant additive spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Failure Resilient BFS Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Fault-Tolerant BFS Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerant Approximate BFS Structures / rank
 
Normal rank

Latest revision as of 00:07, 17 July 2024

scientific article
Language Label Description Also known as
English
Fault-tolerant approximate shortest-path trees
scientific article

    Statements

    Fault-tolerant approximate shortest-path trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest-path trees
    0 references
    fault-tolerant structures
    0 references
    approximate distances
    0 references
    0 references
    0 references