scientific article; zbMATH DE number 4200238

MaRDI QIDQ3348934zbMATH OpenFDO

Authors Alfred J. Boals, Kenneth L. Williams

Publication date 1989

zbMATH Keywords

computationpathDigraphexclusive (M,N)-transitiveminimal edge augmentation

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 4156471
• Theoretical and computational properties of transpositions
• On computing a separating transcendence basis
• Efficient computation of transitive closures
• Trans-dichotomous algorithms without multiplication — some upper and lower bounds
• The complexity of computing the Tutte polynomial on transversal matroids
• Publication:3469272
• Computing \(j\)-multiplicities
• Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
• A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices

Cited in

(2)

• On Making Directed Graphs Transitive
• scientific article; zbMATH DE number 4156471 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348934)