Pages that link to "Item:Q976717"

The following pages link to A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs (Q976717):

Displaying 18 items.

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