An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n^1.75) algorithm for L(2,1)-labeling of trees |
scientific article; zbMATH DE number 5602731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees |
scientific article; zbMATH DE number 5602731 |
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
0.9963436126708984
0 references
0.9657958149909972
0 references
0.9651674032211304
0 references
0.889491081237793
0 references
0.8809043169021606
0 references
