A parametric maximum flow algorithm for bipartite graphs with applications (Q1129980): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(93)e0161-p / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046931398 / rank | |||
Normal rank | |||
Latest revision as of 10:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parametric maximum flow algorithm for bipartite graphs with applications |
scientific article |
Statements
A parametric maximum flow algorithm for bipartite graphs with applications (English)
0 references
16 August 1998
0 references
bipartite graph
0 references
maximum flow
0 references
parametric algorithm
0 references
capacitated bipartite network
0 references
