Inverse problems of transitive closure

MaRDI QIDQ3018231zbMATH OpenFDO

Authors Adrian Deaconu

Publication date 21 July 2011

zbMATH Keywords

graphspermutations

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The Serial Transitive Closure Problem for Trees
• Algorithms for transitive closure
• Transitively reduced and transitively closed event networks
• An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
• Complexité de problèmes liés aux graphes sans circuit

Cited in

(3)

• On best transitive approximations to simple graphs
• Transitively reduced and transitively closed event networks
• An alternative construction to the transitive closure of a directed graph

This page was built for publication: Inverse problems of transitive closure

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