An Algorithm for Finding a Minimal Equivalent Graph of a Digraph

DOI10.1145/321864.321866MaRDI QIDQ4075493zbMATH OpenOpenAlexFDO

Authors Harry T. Hsu

Publication date 1975

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

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

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Algorithms in computer science (68W99)

Cited in

(10)

• The minimum spanning strong subdigraph problem is fixed parameter tractable
• An algorithm for finding a minimal equivalent graph of a strongly connected digraph
• On strongly connected digraphs with bounded cycle length
• Minimum equivalent precedence relation systems
• Reduktion von Präzedenzstrukturen
• Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments
• Reduction of a nilpotent fuzzy matrix
• Extending IC-scheduling via the sweep algorithm
• Exploiting causality in gene network reconstruction based on graph embedding
• Transitive reduction of a nilpotent Boolean matrix

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

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