Realizing degree imbalances in directed graphs
Dhruv Mubayi, Todd G. Will, Douglas B. West · arXiv (Cornell University) · 1998
In a directed graph, the imbalance of a vertex is its outdegree minus its indegree. We characterize the sequences that are realizable as the sequence of imbalances of a simple directed graph. Moreover, a realization of a realizable sequence can be produced by a greedy algorithm.