A note on finding minimum cuts in directed planar networks by parallel computations (Q1069429): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Algorithms in Graph Theory: Planarity Testing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4008192 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum Flow in Planar Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5514188 / rank | |||
Normal rank | |||
Latest revision as of 10:35, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on finding minimum cuts in directed planar networks by parallel computations |
scientific article |
Statements
A note on finding minimum cuts in directed planar networks by parallel computations (English)
0 references
1985
0 references
It is shown that the minimum cut in general planar networks can be found in O((log n)\({}^ 2)\) time by \(O(n^ 4)\) processors. The processor bound can be improved to \(O(n^ 3)\) when the network is embedded in the plane beforehand.
0 references
parallel algorithm
0 references
minimum cut
0 references
general planar networks
0 references
