An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

DOI10.1145/321526.321534MaRDI QIDQ5576821zbMATH OpenOpenAlexDBLPWikidataFDO

Authors D. M. Moyles, G. 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

Cited in

(18)

• 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
• Path-contractions, edge deletions and connectivity preservation
• The role of structural reasoning in the genesis of graph theory
• Minimal equivalent subgraphs containing a given set of arcs
• Digraph Decompositions and Monotonicity in Digraph Searching
• Reduction of a nilpotent fuzzy matrix
• Fast exact algorithms for survivable network design with uniform requirements
• Digraph decompositions and monotonicity in digraph searching
• A structured framework for supporting the participatory development of consensual scenario narratives
• Core stability and strategy-proofness in hedonic coalition formation problems with friend-oriented preferences
• Directed transit functions
• 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

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