Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks (Q3735418): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 11:31, 5 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks |
scientific article |
Statements
Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks (English)
0 references
1986
0 references
network reliability
0 references
probabilistic graph
0 references
all-terminal reliability
0 references
most reliable network
0 references
maximum mean number of communicating vertex pairs
0 references
series-parallel undirected networks
0 references