An Algorithm for Finding a Minimum Equivalent Graph of a Digraph (Q5576821): Difference between revisions
From MaRDI portal
Set profile property. |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:45, 7 March 2024
scientific article; zbMATH DE number 3294300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithm for Finding a Minimum Equivalent Graph of a Digraph |
scientific article; zbMATH DE number 3294300 |
Statements
An Algorithm for Finding a Minimum Equivalent Graph of a Digraph (English)
0 references
1969
0 references
topology
0 references
