Digraph realization problem

The digraph realization problem is a decision problem in graph theory. Given pairs of nonnegative integers $((a_{1},b_{1}),\ldots ,(a_{n},b_{n}))$ , the problem asks whether there is a labeled simple directed graph such that each vertex $v_{i}$ has indegree $a_{i}$ and outdegree $b_{i}$ .

Solutions

The problem belongs to the complexity class P. Two algorithms are known to prove that. The first approach is given by the Kleitman–Wang algorithms constructing a special solution with the use of a recursive algorithm. The second one is a characterization by the Fulkerson–Chen–Anstee theorem, i.e. one has to validate the correctness of $n$ inequalities.

Other Notations

The problem can also be stated in terms of zero-one matrices. The connection can be seen if one realizes that each directed graph has an adjacency matrix where the column sums and row sums correspond to $(a_{1},\cdots ,a_{n})$ and $(b_{1},\ldots ,b_{n})$ . Note that the diagonal of the matrix only contains zeros. The problem is then often denoted by 0-1-matrices for given row and column sums. In the classical literature the problem was sometimes be stated in the context of contingency tables by contingency tables with given marginals.

Related problems

Similar problems describe the degree sequences of simple graphs, simple directed graphs with loops, and simple bipartite graphs. The first problem is the so-called graph realization problem. The second and third one are equivalent and are known as the bipartite realization problem. Chen (1966) gives a characterization for directed multigraphs with a bounded number of parallel arcs and loops to a given degree sequence. The additional constraint of the acycilicity of the directed graph is known as dag realization. Nichterlein & Hartung (2012) proved the NP-completeness of this problem. Berger & Müller-Hannemann (2011) showed that the class of opposed sequences is in P. The problem uniform sampling a directed graph to a fixed degree sequence is to construct a solution for the digraph realization problem with the additional constraint that such each solution comes with the same probability. This problem was shown to be in FPTAS for regular sequences by Catherine Greenhill (2011) The general problem is still unsolved.

References

Chen, Wai-Kai (1966), "On the realization of a (p,s)-digraph with prescribed degrees", Journal of the Franklin Institute, 103: 406–422
Nichterlein, André; Hartung, Sepp (2012), "NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs", Journal of the Franklin Institute, 7318: 283–292
Berger, Annabell; Müller-Hannemann, Matthias (2011), "Dag Realizations of Directed Degree Sequences", Proceedings of the 18th International Conference on Fundamentals of Computation Theory: 264–275
Greenhill, Catherine (2011), "A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs", Electronic Journal of Combinatorics, 18

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.