Geodesic
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/338
Classification : 05C07, 05C20, 90B10, 90C35
Mots-clés : network modeling, directed graphs, degree sequences, greedy algorithm 
@article{10_37236_338,
     author = {P\'eter L. Erd\H{o}s and Istv\'an Mikl\'os and Zolt\'an Toroczkai},
     title = {A simple {Havel-Hakimi} type algorithm to realize graphical degree sequences of directed graphs},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/338},
     zbl = {1215.05035},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/338/}
}
TY  - JOUR
AU  - Péter L. Erdős
AU  - István Miklós
AU  - Zoltán Toroczkai
TI  - A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/338/
DO  - 10.37236/338
ID  - 10_37236_338
ER  - 
%0 Journal Article
%A Péter L. Erdős
%A István Miklós
%A Zoltán Toroczkai
%T A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/338/
%R 10.37236/338
%F 10_37236_338
Péter L. Erdős; István Miklós; Zoltán Toroczkai. A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/338

Cité par Sources :