The algorithm of network topology management using \(k\)-edge connected minimal spanning sub-graph (Q2823959)
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 algorithm of network topology management using k-edge connected minimal spanning sub-graph |
scientific article; zbMATH DE number 6634643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The algorithm of network topology management using \(k\)-edge connected minimal spanning sub-graph |
scientific article; zbMATH DE number 6634643 |
Statements
6 October 2016
0 references
mobile community
0 references
\(k\)-edge-connected
0 references
minimum spanning subgraph
0 references
topology management
0 references
The algorithm of network topology management using \(k\)-edge connected minimal spanning sub-graph (English)
0 references
0.7358309626579285
0 references
0.7227532267570496
0 references
0.7166031002998352
0 references
