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
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 19:07, 30 January 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
    0 references
    21 December 2008
    0 references
    graph of maximum connectivity
    0 references

    Identifiers