On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:18, 5 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
