Function of structural fault tolerance and d-limited connected component of CS graph

DOI10.25209/2079-3316-2018-9-1-85-108zbMATH Open1448.68360OpenAlexW2793400504WikidataQ130164515 ScholiaQ130164515MaRDI QIDQ5117072FDOQ5117072

Authors: V. A. Melent'ev 

Publication date: 20 August 2020

Published in: Program Systems: Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm43

Recommendations

• scientific article; zbMATH DE number 913541
• Largest component and node fault tolerance for grids
• Connectivity
• A group-invariant approach to the synthesis of fault-tolerant systems
• On Minimum Fault-Tolerant Networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cited In (1)

• VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY

This page was built for publication: Function of structural fault tolerance and \(d\)-limited connected component of CS graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5117072)