A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges (Q1274933)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges |
scientific article; zbMATH DE number 1238701
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges |
scientific article; zbMATH DE number 1238701 |
Statements
A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges (English)
0 references
12 January 1999
0 references
algorithms
0 references
time complexity
0 references
partial 2-trees
0 references
series-parallel graph
0 references
network reliability
0 references
