An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5301070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees |
scientific article; zbMATH DE number 5301070 |
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
0.9963436126708984
0 references
0.9676460027694702
0 references
0.9656694531440736
0 references
0.8792321085929871
0 references
0.8718826770782471
0 references
