An Algorithm for Finding a Minimal Equivalent Graph of a Digraph (Q4075493): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 14:06, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithm for Finding a Minimal Equivalent Graph of a Digraph |
scientific article |
Statements
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph (English)
0 references
1975
0 references
