The weak rupture degree of graphs and the network invulnerability (Q3380862)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The weak rupture degree of graphs and the network invulnerability |
scientific article; zbMATH DE number 7403715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The weak rupture degree of graphs and the network invulnerability |
scientific article; zbMATH DE number 7403715 |
Statements
29 September 2021
0 references
combinatorial optimization
0 references
weak rupture degree
0 references
network invulnerability
0 references
0.9314663410186768
0 references
0.8665533065795898
0 references
0.8369161486625671
0 references
0.8365402221679688
0 references
0.8310723900794983
0 references
