Routing complexity of faulty networks (Q5177243): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5436977
 
description / endescription / en
 
scientific article; zbMATH DE number 5227969
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1128.68003 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/rsa.20163 / rank
 
Normal rank
Property / published in
 
Property / published in: Random Structures & Algorithms / rank
 
Normal rank
Property / publication date
 
18 January 2008
Timestamp+2008-01-18T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 18 January 2008 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B18 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5227969 / rank
 
Normal rank
Property / zbMATH Keywords
 
phase transition
Property / zbMATH Keywords: phase transition / rank
 
Normal rank
Property / zbMATH Keywords
 
hypercube
Property / zbMATH Keywords: hypercube / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bound
Property / zbMATH Keywords: lower bound / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2949999231 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chord / rank
 
Normal rank

Latest revision as of 10:22, 6 May 2024

scientific article; zbMATH DE number 5227969
Language Label Description Also known as
English
Routing complexity of faulty networks
scientific article; zbMATH DE number 5227969

    Statements

    Routing complexity of faulty networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 March 2015
    0 references
    18 January 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    fault tolerance
    0 references
    percolation
    0 references
    random graphs
    0 references
    routing
    0 references
    phase transition
    0 references
    hypercube
    0 references
    lower bound
    0 references
    0 references
    0 references
    0 references