On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees. (Q960504): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/jcss.1995.1086 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcss.1995.1086 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070241403 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCSS.1995.1086 / rank | |||
Normal rank | |||
Latest revision as of 10:04, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees. |
scientific article |
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
