Minimum cuts in near-linear time (Q5487825): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q128379265, #quickstatements; #temporary_batch_1730404649853 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964510837 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128379265 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:00, 31 October 2024
scientific article; zbMATH DE number 5052708
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum cuts in near-linear time |
scientific article; zbMATH DE number 5052708 |
Statements
Minimum cuts in near-linear time (English)
0 references
12 September 2006
0 references
time bounds
0 references
minimum cut problem on undirected graphs
0 references
randomized Monte Carlo algorithm
0 references
