Optimal Sequencing by Modular Decomposition: Polynomial Algorithms (Q3750504)
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: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms |
scientific article; zbMATH DE number 3987036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Sequencing by Modular Decomposition: Polynomial Algorithms |
scientific article; zbMATH DE number 3987036 |
Statements
Optimal Sequencing by Modular Decomposition: Polynomial Algorithms (English)
0 references
1986
0 references
partial-order decomposition algorithms
0 references
sequencing
0 references
polynomial time
0 references
precedence constraints
0 references
0.8711066246032715
0 references
0.784510612487793
0 references
0.7675571441650391
0 references
0.7657354474067688
0 references
