On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees. (Q960504)
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: On O(n n) time algorithm for constructing a graph of maximum connective with prescribed degrees. |
scientific article; zbMATH DE number 5476968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees. |
scientific article; zbMATH DE number 5476968 |
Statements
On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees. (English)
0 references
21 December 2008
0 references
graph of maximum connectivity
0 references
0.8425490260124207
0 references
0.7755741477012634
0 references
0.7434415221214294
0 references
0.7350656986236572
0 references
