An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

DOI10.1145/321526.321534zbMath0184.49403DBLPjournals/jacm/MoylesT69OpenAlexW2076447414WikidataQ56699884 ScholiaQ56699884MaRDI QIDQ5576821

D. M. Moyles, Gerald L. Thompson

Publication date: 1969

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321526.321534

zbMATH Keywords

topology

Related Items (15)

Digraph Decompositions and Monotonicity in Digraph Searching ⋮ Approximating Transitive Reductions for Directed Networks ⋮ Maximal and Maximum Transitive Relation Contained in a Given Binary Relation ⋮ On strongly connected digraphs with bounded cycle length ⋮ Minimum equivalent precedence relation systems ⋮ Digraph decompositions and monotonicity in digraph searching ⋮ Path-contractions, edge deletions and connectivity preservation ⋮ Minimal equivalent subgraphs containing a given set of arcs ⋮ Reduction of a nilpotent fuzzy matrix ⋮ The Role of Structural Reasoning in the Genesis of Graph Theory ⋮ An algorithm for finding a minimal equivalent graph of a strongly connected digraph ⋮ Fast exact algorithms for survivable network design with uniform requirements ⋮ Path-Contractions, Edge Deletions and Connectivity Preservation ⋮ Transitive reduction of a rectangular Boolean matrix ⋮ Transitive reduction of a nilpotent Boolean matrix

This page was built for publication: An Algorithm for Finding a Minimum Equivalent Graph of a Digraph