An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
From MaRDI portal
Publication:5576821
DOI10.1145/321526.321534zbMath0184.49403WikidataQ56699884 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
Related Items
Unnamed Item, The Role of Structural Reasoning in the Genesis of Graph Theory, Digraph Decompositions and Monotonicity in Digraph Searching, Minimal equivalent subgraphs containing a given set of arcs, Reduction of a nilpotent fuzzy matrix, Digraph decompositions and monotonicity in digraph searching, Transitive reduction of a rectangular Boolean matrix, Transitive reduction of a nilpotent Boolean matrix, An algorithm for finding a minimal equivalent graph of a strongly connected digraph, Path-contractions, edge deletions and connectivity preservation, On strongly connected digraphs with bounded cycle length, Minimum equivalent precedence relation systems, Approximating Transitive Reductions for Directed Networks, Maximal and Maximum Transitive Relation Contained in a Given Binary Relation