A new algorithm for generating biconnected spanning subgraphs for topological optimization of data networks (Q1289166)
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: A new algorithm for generating biconnected spanning subgraphs for topological optimization of data networks |
scientific article; zbMATH DE number 1290217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for generating biconnected spanning subgraphs for topological optimization of data networks |
scientific article; zbMATH DE number 1290217 |
Statements
A new algorithm for generating biconnected spanning subgraphs for topological optimization of data networks (English)
0 references
24 May 1999
0 references
biconnected spanning subgraphs
0 references
0.7477405667304993
0 references
0.7446687817573547
0 references
0.7259270548820496
0 references
0.7246593832969666
0 references
