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 the normal view instead:
scientific article; zbMATH DE number 2173327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8236480951309204
0 references
0.8182492256164551
0 references
0.7812995314598083
0 references
0.7780550122261047
0 references
0.7766930460929871
0 references
