An Algorithm for Finding a Minimum Equivalent Graph of a Digraph (Q5576821): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56699884, #quickstatements; #temporary_batch_1706359524783 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56699884 / rank | |||
Normal rank | |||
Revision as of 14:07, 27 January 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
