A Faster Algorithm for Finding the Minimum Cut in a Directed Graph (Q4314500): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56542247, #quickstatements; #temporary_batch_1712286835472 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56542247 / rank | |||
Normal rank | |||
Latest revision as of 06:57, 5 April 2024
scientific article; zbMATH DE number 694903
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Faster Algorithm for Finding the Minimum Cut in a Directed Graph |
scientific article; zbMATH DE number 694903 |
Statements
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph (English)
0 references
14 December 1994
0 references
minimum capacity cut
0 references
directed network
0 references
