Finding a Minimum Circuit in a Graph (Q4167596): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/siamcomp/ItaiR78, #quickstatements; #temporary_batch_1731530891435 |
||
| (One intermediate revision by the same user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29041951 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/ItaiR78 / rank | |||
Normal rank | |||
Latest revision as of 22:27, 13 November 2024
scientific article; zbMATH DE number 3601122
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a Minimum Circuit in a Graph |
scientific article; zbMATH DE number 3601122 |
Statements
Finding a Minimum Circuit in a Graph (English)
0 references
1978
0 references
