A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs (Q976717)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs |
scientific article; zbMATH DE number 5721460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs |
scientific article; zbMATH DE number 5721460 |
Statements
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs (English)
0 references
16 June 2010
0 references
Summary: One of the simplest ways to decide whether a given finite sequence of positive integers can arise as the degree sequence of a simple graph is the greedy algorithm of Havel and Hakimi. This note extends their approach to directed graphs. It also studies cases of some simple forbidden edge-sets. Finally, it proves a result which is useful to design an MCMC algorithm to find random realizations of prescribed directed degree sequences.
0 references
network modeling
0 references
directed graphs
0 references
degree sequences
0 references
greedy algorithm
0 references
0.8136407732963562
0 references
0.8081578612327576
0 references
0.8008239269256592
0 references
0.7960320711135864
0 references
