Self-adjusting grid networks to minimize expected path length (Q2345461): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive routing strategy for packet delivery in complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum congestion mapping in a cloud / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of minimizing wire lengths in VLSI layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Self-stabilizing and Local Delaunay Graph Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Revision as of 02:36, 10 July 2024

scientific article
Language Label Description Also known as
English
Self-adjusting grid networks to minimize expected path length
scientific article

    Statements

    Self-adjusting grid networks to minimize expected path length (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 May 2015
    0 references
    self-adjusting networks
    0 references
    distributed algorithms
    0 references
    routing
    0 references
    approximation
    0 references
    minimum-linear-arrangement
    0 references
    energy-efficient
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references