The structure of max ?-minm?+1 graphs used in the design of reliable networks (Q4369760)
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 1103044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The structure of max ?-minm?+1 graphs used in the design of reliable networks |
scientific article; zbMATH DE number 1103044 |
Statements
12 January 1998
0 references
distillating graph
0 references
nearly independent edge-disconnecting set
0 references
incidence set
0 references
design
0 references
reliable networks
0 references
The structure of max ?-minm?+1 graphs used in the design of reliable networks (English)
0 references
0.8462640047073364
0 references
0.7998841404914856
0 references
0.7876505851745605
0 references
