A fast bipartite network flow algorithm for selective assembly (Q1273091)
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: A fast bipartite network flow algorithm for selective assembly |
scientific article; zbMATH DE number 1229531
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast bipartite network flow algorithm for selective assembly |
scientific article; zbMATH DE number 1229531 |
Statements
A fast bipartite network flow algorithm for selective assembly (English)
0 references
6 December 1998
0 references
bipartite graphs
0 references
preemptive scheduling
0 references
selective assembly
0 references
Monge property
0 references
network flow
0 references
earliest due date
0 references
bipartite network flow
0 references
linear-time algorithm
0 references
0 references
0 references
