Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems (Q1970336): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1009827520712 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1527017525 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems |
scientific article |
Statements
Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems (English)
0 references
19 March 2000
0 references
transversal
0 references
partially ordered set
0 references
supersequence
0 references
merging
0 references
scheduling
0 references
