An Algorithm for Finding a Minimum Equivalent Graph of a Digraph (Q5576821): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56699884, #quickstatements; #temporary_batch_1706359524783 |
Created claim: DBLP publication ID (P1635): journals/jacm/MoylesT69, #quickstatements; #temporary_batch_1731530891435 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/MoylesT69 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:40, 13 November 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
