Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127908552, #quickstatements; #temporary_batch_1722209980517 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127908552 / rank | |||
Normal rank | |||
Revision as of 00:40, 29 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for minimum weighted colouring of some classes of perfect graphs |
scientific article |
Statements
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (English)
0 references
5 July 1995
0 references
comparability graph
0 references
polynomial algorithm
0 references
