An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
From MaRDI portal
Publication:4075493
DOI10.1145/321864.321866zbMath0316.05114OpenAlexW1981358946MaRDI QIDQ4075493
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
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments ⋮ On strongly connected digraphs with bounded cycle length ⋮ Minimum equivalent precedence relation systems ⋮ Extending IC-scheduling via the sweep algorithm ⋮ Reduktion von Präzedenzstrukturen ⋮ Reduction of a nilpotent fuzzy matrix ⋮ An algorithm for finding a minimal equivalent graph of a strongly connected digraph ⋮ The minimum spanning strong subdigraph problem is fixed parameter tractable ⋮ Exploiting causality in gene network reconstruction based on graph embedding ⋮ Transitive reduction of a nilpotent Boolean matrix