Results 101 to 107 of about 4,536 (107)
Some of the next articles are maybe not open access.
Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
SIAM Journal on Discrete Mathematics, 2003Jing Huang, Anders Yeo
exaly
On the structure of strong 3-quasi-transitive digraphs
Discrete Mathematics, 2010Ilan A Goldfeder
exaly
Algorithmus 26 An algorithm for finding the transitive closure of a digraph
Computing (Vienna/New York), 1975exaly
A modification of Warshall's algorithm for the transitive closure of binary relations
Communications of the ACM, 1975exaly