An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications (Q4806910)
From MaRDI portal
!
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 1911096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications |
scientific article; zbMATH DE number 1911096 |
Statements
An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications (English)
0 references
14 May 2003
0 references
graph theory
0 references
optimization
0 references
minimum cut
0 references
maximum flow problem
0 references
hypergraph
0 references
0.88647157
0 references
0.88025373
0 references
0.87376285
0 references
0.87023234
0 references
0.86721796
0 references
0.86294806
0 references
0.8609382
0 references
0.8595313
0 references
0.85864925
0 references
