An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_18 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W171866752 / rank | |||
Normal rank | |||
Revision as of 02:57, 20 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
