The strongly connected reliability of complete digraphs (Q4680417): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:24, 7 February 2024
scientific article; zbMATH DE number 2173327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The strongly connected reliability of complete digraphs |
scientific article; zbMATH DE number 2173327 |
Statements
The strongly connected reliability of complete digraphs (English)
0 references
1 June 2005
0 references
algorithm
0 references
reachability
0 references
