On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees.

From MaRDI portal
Publication:960504