Computing the Strength of a Graph (Q3978173)
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 14000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the Strength of a Graph |
scientific article; zbMATH DE number 14000 |
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
0.9019511
0 references
0 references
0 references
0.87812406
0 references
0.8764739
0 references
0.87572837
0 references
