On the complexity of a restricted list-coloring problem (Q1296975): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Q494075 / rank | |||
| Property / author | |||
| Property / author: Wiesław X. Kubiak / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling tasks on two processors with deadlines and additional resources / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3922703 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3115277 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Restricted coloring models for timetabling / rank | |||
Normal rank | |||
Latest revision as of 20:30, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of a restricted list-coloring problem |
scientific article |
Statements
On the complexity of a restricted list-coloring problem (English)
0 references
3 August 1999
0 references
restricted list-coloring
0 references
polynomial algorithm
0 references
