The algorithmic complexity of colour switching (Q1199936): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q126857207, #quickstatements; #temporary_batch_1723583190453 |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Faster Scaling Algorithms for Network Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5519710 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q126857207 / rank | |||
Normal rank |
Latest revision as of 22:09, 13 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The algorithmic complexity of colour switching |
scientific article |
Statements
The algorithmic complexity of colour switching (English)
0 references
17 January 1993
0 references
graph colouring
0 references
colour switching problem
0 references
weighted matching problem
0 references
channel allocation
0 references