A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs

zbMath1215.05035arXiv0905.4913MaRDI QIDQ976717

Péter L. Erdős, István Miklós, Zoltán Toroczkai

Publication date: 16 June 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.4913

zbMATH Keywords

greedy algorithmdirected graphsnetwork modelingdegree sequences

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items (18)

Directed Networks with a Differentially Private Bi-degree Sequence ⋮ Mathematical tools for the future: graph theory and graphicable algebras ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs ⋮ Methods for the graph realization problem ⋮ Sampling contingency tables ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Constructing and sampling directed graphs with given degree sequences ⋮ A polynomial time algorithm to find the star chromatic index of trees ⋮ Rejection sampling of bipartite graphs with given degree sequence ⋮ Exact sampling of graphs with prescribed degree correlations ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ Uniform Sampling of Digraphs with a Fixed Degree Sequence ⋮ Asymptotics in directed exponential random graph models with an increasing bi-degree sequence ⋮ Split digraphs ⋮ Directed random graphs with given degree distributions ⋮ Relaxed and approximate graph realizations

This page was built for publication: A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs