Methods for the graph realization problem

DOI10.2478/AUSI-2023-0017OpenAlexW4389623434MaRDI QIDQ6152848FDOQ6152848

Authors Zoltán Kása, Pál A. Kupán, Csaba György Pătcaş 

Publication date 13 February 2024

Published in Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2478/ausi-2023-0017

zbMATH Keywords

degree sequencesflow networksbigraphical listsgraph realization algorithmsgraphical listsmodified Edmonds-Karp algorithm

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 5990082 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 840688 (Why is no real title available?)
• scientific article; zbMATH DE number 3270499 (Why is no real title available?)
• A remark on the existence of finite graphs
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
• A simple criterion on degree sequences of graphs
• Algorithms for constructing graphs and digraphs with given valences and factors
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Constructing and sampling directed graphs with given degree sequences
• Degree-based graph construction
• Dominance order and graphical partitions
• Efficient generation of graphical partitions
• On Erdös-Gallai and Havel-Hakimi algorithms
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: Methods for the graph realization problem

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