On mimicking networks representing minimum terminal cuts (Q2446595)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6286634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On mimicking networks representing minimum terminal cuts |
scientific article; zbMATH DE number 6286634 |
Statements
On mimicking networks representing minimum terminal cuts (English)
0 references
17 April 2014
0 references
analysis of algorithms
0 references
approximation algorithms
0 references
combinatorial problems
0 references
graph algorithms
0 references
0 references
0.8915762901306152
0 references
0.862825334072113
0 references
0.8476800918579102
0 references
0.8453654646873474
0 references
0.7732725739479065
0 references
