Greedy colorings for the binary paintshop problem (Q2266932): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity results on restricted instances of a paint shop problem for words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity results on a paint shop problem. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paintshop, odd cycles and necklace splitting / rank | |||
Normal rank | |||
Latest revision as of 12:32, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy colorings for the binary paintshop problem |
scientific article |
Statements
Greedy colorings for the binary paintshop problem (English)
0 references
26 February 2010
0 references
greedy algorithm
0 references
paintshop problem
0 references
probabilistic bound
0 references
