The strongly connected reliability of complete digraphs (Q4680417)
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: The strongly connected reliability of complete digraphs |
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
