Computing all the best swap edges distributively (Q436830): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Paola Flocchini / rank
Normal rank
 
Property / author
 
Property / author: Linda Pagli / rank
Normal rank
 
Property / author
 
Property / author: Giuseppe Prencipe / rank
Normal rank
 
Property / author
 
Property / author: Nicola Santoro / rank
Normal rank
 
Property / author
 
Property / author: Peter Widmayer / rank
Normal rank
 
Property / author
 
Property / author: Linda Pagli / rank
 
Normal rank
Property / author
 
Property / author: Paola Flocchini / rank
 
Normal rank
Property / author
 
Property / author: Giuseppe Prencipe / rank
 
Normal rank
Property / author
 
Property / author: Nicola Santoro / rank
 
Normal rank
Property / author
 
Property / author: Peter Widmayer / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M14 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6059798 / rank
 
Normal rank
Property / zbMATH Keywords
 
fault-tolerant routing
Property / zbMATH Keywords: fault-tolerant routing / rank
 
Normal rank
Property / zbMATH Keywords
 
point of failure rerouting
Property / zbMATH Keywords: point of failure rerouting / rank
 
Normal rank
Property / zbMATH Keywords
 
swap edge
Property / zbMATH Keywords: swap edge / rank
 
Normal rank
Property / zbMATH Keywords
 
distributed algorithms
Property / zbMATH Keywords: distributed algorithms / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jpdc.2008.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1700848872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparser: A Paradigm for Running Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-tree approach to reliability in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single backup table schemes for shortest-path routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swapping a failing edge of a single source shortest paths tree is good and fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Path Compression on Balanced Trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:38, 5 July 2024

scientific article
Language Label Description Also known as
English
Computing all the best swap edges distributively
scientific article

    Statements

    Computing all the best swap edges distributively (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    fault-tolerant routing
    0 references
    point of failure rerouting
    0 references
    swap edge
    0 references
    distributed algorithms
    0 references
    0 references