An algorithm for transitive reduction of an acyclic graph

DOI10.1016/0167-6423(89)90039-7zbMath0678.68061OpenAlexW2113553164MaRDI QIDQ1124350

David Gries, Jan L. A. van de Snepscheut, Jan Tijmen Udding, Alain J. Martin

Publication date: 1989

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(89)90039-7

zbMATH Keywords

transitive closureacyclic digraphtransitive reduction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Best match graphs ⋮ Origami fold as algebraic graph rewriting

This page was built for publication: An algorithm for transitive reduction of an acyclic graph