On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q62595924, #quickstatements; #temporary_batch_1711055989931 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62595924 / rank | |||
Normal rank | |||
Revision as of 00:52, 22 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs |
scientific article |
Statements
On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (English)
0 references
4 April 2013
0 references
analysis of algorithms
0 references
combinatorial problems
0 references
graph algorithms
0 references
\(L(2,1)\)-labeling
0 references
list labeling
0 references
graph coloring model
0 references
exact algorithm
0 references
