scientific article; zbMATH DE number 3958732

MaRDI QIDQ3727385zbMATH OpenFDO

Authors Klaus Simon

Publication date 1986

zbMATH Keywords

chain decompositiongraph algorithmtransitive reduction

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An improved algorithm for transitive closure on acyclic digraphs
• An algorithm for transitive reduction of an acyclic graph
• Algorithms for transitive closure
• The transitive closure of a random digraph
• On the calculation of transitive reduction-closure of orders

Cited in

(15)

• An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
• An improved algorithm for transitive closure on acyclic digraphs
• An algorithm for transitive reduction of an acyclic graph
• Speeding up dynamic transitive closure for bounded degree graphs
• A new variant of the \(A^*\)-algorithm which closes a node at most once.
• Algorithms for dense graphs and networks on the random access computer
• scientific article; zbMATH DE number 3866595 (Why is no real title available?)
• On the Minimisation of Acyclic Models
• scientific article; zbMATH DE number 3980508 (Why is no real title available?)
• scientific article; zbMATH DE number 1208713 (Why is no real title available?)
• scientific article; zbMATH DE number 219269 (Why is no real title available?)
• Transitive closure and transitive reduction in bidirected graphs
• Algorithms for longest chains in pseudo-transitive graphs
• scientific article; zbMATH DE number 6783482 (Why is no real title available?)
• On the calculation of transitive reduction-closure of orders

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 Q3727385)