An Algorithm for Finding a Minimum Equivalent Graph of a Digraph (Q5576821): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/321526.321534 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076447414 / rank | |||
Normal rank | |||
Latest revision as of 20:04, 19 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
