A loop-free shortest-path routing algorithm for dynamic networks (Q385951): 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 / Wikidata QID
 
Property / Wikidata QID: Q115036544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially dynamic efficient algorithms for distributed shortest paths / 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: Another adaptive distributed shortest path algorithm / 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 finding and updating shortest paths distributively / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361866 / 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: Termination detection for diffusing computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering a new algorithm for distributed shortest paths on dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank

Latest revision as of 03:31, 7 July 2024

scientific article
Language Label Description Also known as
English
A loop-free shortest-path routing algorithm for dynamic networks
scientific article

    Statements

    Identifiers