Skip to search formSkip to main contentSkip to account menu

Transitive reduction

In mathematics, a transitive reduction of a directed graph is a graph with as few edges as possible that has the same reachability relation as the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We introduce a new online deadlock-avoidance policy, Transitive Joins (TJ), that targets programs with dynamic task parallelism… 
2011
2011
We prove that, in both real and complex cases, there exists a pair of matrices that generates a dense subsemigroup of the set of… 
2004
2004
We consider the lossless compression of vertex transitive graphs. An undirected graph G = (V, E) is called vertex transitive if… 
2004
2004
  • 2004
  • Corpus ID: 16542167
In this note we consider only non-trivial laballed oriented graphs, i .e . digraphs D having at least one arc, no loops, and for… 
2003
2003
The periodic properties of reversible one-dimensional cellular automata are analyzed. The configuration set is taken as a… 
1991
1991
Let O(x) be the orbit of x under a homeomorphism h on a metric space X. It is shown that this motion can be found in the shift on… 
1976
1976
A flag transitive affine plane of order 27 is constructed. The stabilizer of the origin of this plane contains a cyclic subgroup…