A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems (Q1130399): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed program reliability analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Network Reliability Analysis: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Computing <i>K</i>-Terminal Reliability in Series-Parallel Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Algorithms for Computing K-Terminal Network Reliability / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0898-1221(97)00210-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074761435 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:59, 30 July 2024

scientific article
Language Label Description Also known as
English
A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems
scientific article

    Statements

    A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems (English)
    0 references
    0 references
    0 references
    0 references
    20 August 1998
    0 references
    reliability
    0 references
    distributed computing systems
    0 references
    distributed program reliability
    0 references
    distributed system reliability
    0 references

    Identifiers