On the construction of most reliable networks (Q1827833): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jian'er Chen / rank
Normal rank
 
Property / author
 
Property / author: Qi-Ju Gao / rank
Normal rank
 
Property / author
 
Property / author: Jian'er Chen / rank
 
Normal rank
Property / author
 
Property / author: Qi-Ju Gao / 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.dam.2003.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012297436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization problems in the analysis and design of probabilistic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super Line-Connectivity Properties of Circulant Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of max ?-minm?+1 graphs used in the design of reliable networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:28, 6 June 2024

scientific article
Language Label Description Also known as
English
On the construction of most reliable networks
scientific article

    Statements

    On the construction of most reliable networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    Reliability
    0 references
    Restricted edge
    0 references
    Connectivity
    0 references
    Circulant graph
    0 references
    Harary graph
    0 references

    Identifiers