Methods for the graph realization problem
From MaRDI portal
Publication:6152848
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
degree sequencesflow networksbigraphical listsgraph realization algorithmsgraphical listsmodified Edmonds-Karp algorithm
Cites Work
- Constructing and sampling directed graphs with given degree sequences
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for constructing graphs and digraphs with given valences and factors
- A remark on the existence of finite graphs
- Efficient generation of graphical partitions
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Degree-based graph construction
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Dominance order and graphical partitions
- A simple criterion on degree sequences of graphs
- Title not available (Why is that?)
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)
