Computing rooted communication reliability in an almost acyclic digraph (Q3978609)
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 12556
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing rooted communication reliability in an almost acyclic digraph |
scientific article; zbMATH DE number 12556 |
Statements
Computing rooted communication reliability in an almost acyclic digraph (English)
0 references
25 June 1992
0 references
almost acyclic digraph
0 references
unreliable arcs
0 references
root-vertex
0 references
directed network
0 references
random failure
0 references
0.8407668471336365
0 references
0.8294441103935242
0 references
0.8047283291816711
0 references
0.8044514656066895
0 references
0.8030154705047607
0 references
