A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs.
Erdős, Péter L.; Miklós, István; Toroczkai, Zoltán
The Electronic Journal of Combinatorics [electronic only] (2010)
- Volume: 17, Issue: 1, page Research Paper R66, 10 p.-Research Paper R66, 10 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topErdős, Péter L., Miklós, István, and Toroczkai, Zoltán. "A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs.." The Electronic Journal of Combinatorics [electronic only] 17.1 (2010): Research Paper R66, 10 p.-Research Paper R66, 10 p.. <http://eudml.org/doc/227072>.
@article{Erdős2010,
author = {Erdős, Péter L., Miklós, István, Toroczkai, Zoltán},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {network modeling; directed graphs; degree sequences; greedy algorithm},
language = {eng},
number = {1},
pages = {Research Paper R66, 10 p.-Research Paper R66, 10 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs.},
url = {http://eudml.org/doc/227072},
volume = {17},
year = {2010},
}
TY - JOUR
AU - Erdős, Péter L.
AU - Miklós, István
AU - Toroczkai, Zoltán
TI - A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2010
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 17
IS - 1
SP - Research Paper R66, 10 p.
EP - Research Paper R66, 10 p.
LA - eng
KW - network modeling; directed graphs; degree sequences; greedy algorithm
UR - http://eudml.org/doc/227072
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.