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

DOI10.1006/JCSS.1995.1086zbMATH Open1294.05144OpenAlexW2070241403MaRDI QIDQ960504FDOQ960504

Authors: T. Asano 

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

Recommendations

• Constructing a bipartite graph of maximum connectivity with prescribed degrees
• An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
• scientific article; zbMATH DE number 4097423
• On Erdös-Gallai and Havel-Hakimi algorithms
• Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results

zbMATH Keywords

graph of maximum connectivity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cited In (5)

• Inferring a graph from path frequency
• Characterization of optimal key set protocols
• Title not available (Why is that?)
• An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
• Degree sequences and edge connectivity

This page was built for publication: On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960504)