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

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

2009-05-29

arxiv.org/abs/0905.4913v2

Mathematics

Combinatorics

11 pages, 1 figure submitted to "The Electronic Journal of Combinatorics"

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527509