Partially dynamic efficient algorithms for distributed shortest paths (Q2268860): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3361866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully dynamic algorithm for distributed shortest paths. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to dynamic all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another adaptive distributed shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed shortest-path protocols for time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of dynamic graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding and updating shortest paths distributively / rank
 
Normal rank

Latest revision as of 13:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Partially dynamic efficient algorithms for distributed shortest paths
scientific article

    Statements

    Identifiers