Finding a minimum equivalent graph of a digraph (Q3944018)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a minimum equivalent graph of a digraph |
scientific article |
Statements
Finding a minimum equivalent graph of a digraph (English)
0 references
1982
0 references
removing the maximum number of edges from a digraph without affecting its reachability properties
0 references
worst-case performance of algorithms
0 references
reduction procedure
0 references
branch and bound search
0 references
