An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 12:36, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees |
scientific article |
Statements
An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (English)
0 references
15 July 2008
0 references
frequency/channel assignment
0 references
graph algorithm
0 references
\(L(2, 1)\)-labeling
0 references
vertex coloring
0 references
