On Some Variants of the Bandwidth Minimization Problem (Q3335004)
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 3868635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Some Variants of the Bandwidth Minimization Problem |
scientific article; zbMATH DE number 3868635 |
Statements
On Some Variants of the Bandwidth Minimization Problem (English)
0 references
1984
0 references
multiprocessor scheduling
0 references
directed graphs
0 references
forests
0 references
interval orders
0 references
bandwidth minimization
0 references
cycle-bandwidth
0 references
circular layout
0 references
separation
0 references
linear layout
0 references
cycle-separation
0 references
NP-complete
0 references
directed separation
0 references
polynomial time algorithms
0 references
0.8057756423950195
0 references
0.7838904857635498
0 references
