Skip to search formSkip to main contentSkip to account menu

Digraph realization problem

The digraph realization problem is a decision problem in graph theory. Given pairs of nonnegative integers , the problem asks whether there is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Adjacency matrixBipartite realization problemContingency tableDecision problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
How to Attack the NP-complete Dag Realization Problem in Practice
We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence $S:={a_1 \choose b_1… 
2012
2012
The Connection between the Number of Realizations for Degree Sequences and Majorization
The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or… 
2011
2011
A note on the characterization of digraphic sequences
2009
2009
Neighborhood hypergraphs of digraphs and some matrix permutation problems
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)