Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (Q2941562)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time |
scientific article |
Statements
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (English)
0 references
21 August 2015
0 references
deterministic near-linear time
0 references
edge connectivity
0 references
minimum cut
0 references
simple graphs
0 references
0 references
