Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios (Q905697): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361866 / 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: Engineering a new algorithm for distributed shortest paths on dynamic networks / 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 loop-free shortest-path routing algorithm for dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another adaptive distributed shortest path algorithm / 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: Distributed shortest-path protocols for time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3391607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding and updating shortest paths distributively / rank
 
Normal rank

Latest revision as of 08:59, 11 July 2024

scientific article
Language Label Description Also known as
English
Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
scientific article

    Statements

    Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 January 2016
    0 references
    design and analysis of algorithms
    0 references
    computer communication networks
    0 references
    distributed algorithms
    0 references
    dynamic algorithms
    0 references
    shortest paths
    0 references
    experimental analysis
    0 references

    Identifiers