An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161): 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 01:21, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees |
scientific article |
Statements
An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (English)
0 references
10 September 2009
0 references
frequency/channel assignment
0 references
graph algorithm
0 references
\(L(2, 1)\)-labeling
0 references
vertex coloring
0 references
