Results 1  10
of
5,426
Counting Acyclic Digraphs By Sources And Sinks
, 1995
"... We count labeled acyclic digraphs according to the number sources, sinks, and edges. ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We count labeled acyclic digraphs according to the number sources, sinks, and edges.
MORE ON COUNTING ACYCLIC DIGRAPHS
, 804
"... Abstract. In this note we derive enumerative formulas for several types of labelled acyclic directed graphs by slight modifications of the familiar recursive formula for simple acyclic digraphs. These considerations are motivated by, and based upon, recent combinatorial results in geometric topology ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In this note we derive enumerative formulas for several types of labelled acyclic directed graphs by slight modifications of the familiar recursive formula for simple acyclic digraphs. These considerations are motivated by, and based upon, recent combinatorial results in geometric
Maximum directed cuts in acyclic digraphs
"... It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of a largest directed cut in acyclic digraphs, and prove a number of related results concerning cuts in digraphs and acyclic dig ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of a largest directed cut in acyclic digraphs, and prove a number of related results concerning cuts in digraphs and acyclic
A characterization of Markov equivalence classes for acyclic digraphs
, 1995
"... Undirected graphs and acyclic digraphs (ADGs), as well as their mutual extension to chain graphs, are widely used to describe dependencies among variables in multivariate distributions. In particular, the likelihood functions of ADG models admit convenient recursive factorizations that often allow e ..."
Abstract

Cited by 122 (7 self)
 Add to MetaCart
Undirected graphs and acyclic digraphs (ADGs), as well as their mutual extension to chain graphs, are widely used to describe dependencies among variables in multivariate distributions. In particular, the likelihood functions of ADG models admit convenient recursive factorizations that often allow
Algorithms for Generating Convex Sets in Acyclic Digraphs
, 2008
"... A set X of vertices of an acyclic digraph D is convex if X � = ∅ and there is no directed path between vertices of X which contains a vertex not in X. A set X is connected if X � = ∅ and the underlying undirected graph of the subgraph of D induced by X is connected. Connected convex sets and conve ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
A set X of vertices of an acyclic digraph D is convex if X � = ∅ and there is no directed path between vertices of X which contains a vertex not in X. A set X is connected if X � = ∅ and the underlying undirected graph of the subgraph of D induced by X is connected. Connected convex sets
An algorithm for finding connected convex subgraphs of an acyclic digraph
 IN ‘ALGORITHMS AND COMPLEXITY IN
, 2008
"... abstract. A subgraph H of an acyclic digraph D is convex if there is no directed path between vertices of H which contains an arc not in H. A digraph D is connected if the underlying undirected graph of D is connected. We construct an algorithm for enumeration of all connected convex subgraphs of a ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
abstract. A subgraph H of an acyclic digraph D is convex if there is no directed path between vertices of H which contains an arc not in H. A digraph D is connected if the underlying undirected graph of D is connected. We construct an algorithm for enumeration of all connected convex subgraphs of a
A LOCAL HIERARCHY THEORY FOR ACYCLIC DIGRAPHS
"... generalized Lorenz curve, citation analysis, organizational charts Local hierarchy theory focuses on direct links in acyclic digraphs. In and outdegrees are used to determine the local hierarchical number for each vertex in the graph. Together, these local hierarchical numbers from a vector throug ..."
Abstract
 Add to MetaCart
generalized Lorenz curve, citation analysis, organizational charts Local hierarchy theory focuses on direct links in acyclic digraphs. In and outdegrees are used to determine the local hierarchical number for each vertex in the graph. Together, these local hierarchical numbers from a vector
Results 1  10
of
5,426