Reliability analysis of a simple replicated and-fork/and-join graph (Q1342096): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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/0167-6377(94)90022-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2152211037 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Survey of Network Reliability and Domination Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Complexity of Network Reliability Analysis: An Overview / rank | |||
Normal rank | |||
Latest revision as of 10:19, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reliability analysis of a simple replicated and-fork/and-join graph |
scientific article |
Statements
Reliability analysis of a simple replicated and-fork/and-join graph (English)
0 references
15 May 1995
0 references
fork-join graphs
0 references
reliability
0 references
task graph
0 references
NP-complete
0 references
