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.
2009
2009
Pairwise comparison matrices over abelian linearly ordered groups have been introduced in our previous works, where we focused on… 
2006
2006
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges… 
2004
2004
If vast quantities of data elements are considered, catalogues provide an intuitive way of organisation. While in common use the… 
1994
1994
In the past, different authors developed distinct approaches to the problem of transitive orientation. This also resulted in… 
1990
1990
The authors provide distinct algorithms for computing transitive closure and transitive reduction with sequential time… 
1976
1976
A flag transitive affine plane of order 27 is constructed. The stabilizer of the origin of this plane contains a cyclic subgroup… 
1974
1974
+ l preserve asblock desig inn which X = I and k = q + l. Anothe irs exampl PSL(«,q), ne > 2,which preserves a block design in… 
1970
1970
Let Ω be the set of symbols 1,2,..., n. Let be a doubly transitive group on Ω of order 6n(n — 1) not containing a regular normal…