An algorithm for finding a minimal equivalent graph of a strongly connected digraph

DOI10.1007/BF02253052zbMath0397.05028OpenAlexW398974528MaRDI QIDQ1253667

Silvano Martello

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02253052

zbMATH Keywords

AlgorithmImplementationFortranBranch And Bound AlgorithmFinding 2 Minimal Equivalent GraphReachability PropertiesStrongly Connected Digraph

Mathematics Subject Classification ID

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

Cites Work

• An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
• An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

This page was built for publication: An algorithm for finding a minimal equivalent graph of a strongly connected digraph