Computing the Strength of a Graph (Q3978173): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:27, 29 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Strength of a Graph |
scientific article |
Statements
Computing the Strength of a Graph (English)
0 references
25 June 1992
0 references
graph vulnerability
0 references
strength of a group
0 references
polymatroid greedy algorithm
0 references
parametric flow in a bipartite network
0 references
