On two-processor scheduling and maximum matching in permutation graphs (Q1351633)
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: On two-processor scheduling and maximum matching in permutation graphs |
scientific article; zbMATH DE number 984463
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On two-processor scheduling and maximum matching in permutation graphs |
scientific article; zbMATH DE number 984463 |
Statements
On two-processor scheduling and maximum matching in permutation graphs (English)
0 references
27 February 1997
0 references
Algorithms
0 references
Two-processor scheduling
0 references
Maximum matching
0 references
Permutation graphs
0 references
