The distributed program reliability analysis on ring-type topologies (Q5939969): 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: Factoring Algorithms for Computing K-Terminal Network Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Reliability Computations in Planar and Acyclic Graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0305-0548(99)00151-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987655061 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:57, 30 July 2024

scientific article; zbMATH DE number 1623680
Language Label Description Also known as
English
The distributed program reliability analysis on ring-type topologies
scientific article; zbMATH DE number 1623680

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references