Results 131 to 140 of about 4,954 (163)
TRaCE+: Ensemble inference of gene regulatory networks from transcriptional expression profiles of gene knock-out experiments. [PDF]
BMC Bioinformatics, 2016 Ud-Dean SM, Heise S, Klamt S, Gunawan R.
europepmc +1 more source
Balance correlations, agentic zeros, and networks: The structure of 192 years of war and peace. [PDF]
PLoS OneDekker D +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Graph Theory, 1995
AbstractA digraph is quasi‐transitive if there is a complete adjacency between the inset and the outset of each vertex. Quasi‐transitive digraphs are interseting because of their relation to comparability graphs. Specifically, a graph can be oriented as a quasi‐transitive digraph if and only if it is a comparability graph. Quasi‐transitive digraphs are
Bang-Jensen, Jørgen, Huang, Jing
openaire +2 more sources
AbstractA digraph is quasi‐transitive if there is a complete adjacency between the inset and the outset of each vertex. Quasi‐transitive digraphs are interseting because of their relation to comparability graphs. Specifically, a graph can be oriented as a quasi‐transitive digraph if and only if it is a comparability graph. Quasi‐transitive digraphs are
Bang-Jensen, Jørgen, Huang, Jing
openaire +2 more sources
Richardson’s theorem in quasi-transitive and pre-transitive digraphs
Graphs and Combinatorics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Galeana-Sánchez, Hortensia +1 more
openaire +1 more source
Infinite highly arc transitive digraphs and universal covering digraphs
Combinatorica, 1993A digraph \(D\) is said to be \(s\)-arc transitive if its automorphism group is transitive on the set of \(s\)-arcs, and \(D\) is said to be highly arc transitive if it is \(s\)-arc transitive for all finite \(s\geq 0\). The authors give a few methods for obtaining new highly arc transitive digraphs from a given one. They attempt to characterize highly
Cameron, Peter J. +2 more
openaire +2 more sources
7. Testing Transitivity in Digraphs
Sociological Methodology, 1999The problem of testing the transitivity of a relationship observed in a digraph, taking as many nontransitivity related irregularities as possible into account, is studied. Two test quantities are used: (1) the proportion of transitive triples out of all nonvacuously transitive triples, and (2) the density difference (the difference between mean local
openaire +1 more source