Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127908552, #quickstatements; #temporary_batch_1722209980517 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(94)90004-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011254347 / rank | |||
Normal rank | |||
Latest revision as of 09:46, 30 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
