On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees.
From MaRDI portal
Publication:960504
DOI10.1006/JCSS.1995.1086zbMath1294.05144OpenAlexW2070241403MaRDI QIDQ960504
Publication date: 21 December 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1995.1086
Related Items (2)
This page was built for publication: On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees.