An algorithm for finding a minimal equivalent graph of a strongly connected digraph (Q1253667)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for finding a minimal equivalent graph of a strongly connected digraph |
scientific article; zbMATH DE number 3616462
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a minimal equivalent graph of a strongly connected digraph |
scientific article; zbMATH DE number 3616462 |
Statements
An algorithm for finding a minimal equivalent graph of a strongly connected digraph (English)
0 references
1979
0 references
Algorithm
0 references
Reachability Properties
0 references
Strongly Connected Digraph
0 references
Implementation
0 references
Finding 2 Minimal Equivalent Graph
0 references
Fortran
0 references
Branch And Bound Algorithm
0 references