Naslov: | No-hole λ-L (k, k – 1, …, 2,1)-labeling for square grid |
---|
Avtorji: | ID Atta, Soumen, Department of Computer Science and Engineering, University of Kalyani, Kalyani-741235, West Bengal, India (Avtor) ID Goldstein, Stanisław, Faculty of Mathematics and Computer Science, University of Lodz, Banacha 22, PL-90-235 Lodz, Poland (Avtor) ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science and Engineering, University of Kalyani, Kalyani-741235, West Bengal, India (Avtor) |
Datoteke: |
Gradivo nima datotek, ki so prostodostopne za javnost. Gradivo je morda fizično dosegljivo v knjižnici fakultete, zalogo lahko preverite v COBISS-u. |
---|
Jezik: | Angleški jezik |
---|
Vrsta gradiva: | Delo ni kategorizirano |
---|
Tipologija: | 1.01 - Izvirni znanstveni članek |
---|
Organizacija: | UNG - Univerza v Novi Gorici
|
---|
Opis: | Motivated by a frequency assignment problem, we demonstrate, for a fixed positive integer k, how to label an infinite square grid with a possibly small number of integer labels, ranging from 0 to λ −1, in such a way that labels of adjacent vertices differ by at least k, vertices connected by a path of length two receive values which differ by at least k − 1, and so on. The vertices which are at least k + 1 distance apart may receive the same label. By finding a lower bound for λ, we prove that the solution is close to optimal, with approximation ratio at most 9/8. The labeling presented is a no-hole one, i.e., it uses each of the allowed labels at least once. |
---|
Ključne besede: | graph labeling, labeling number, no-hole labeling, square grid, frequency assignment problem, approximation ratio |
---|
Leto izida: | 2017 |
---|
Št. strani: | 9-19 |
---|
Številčenje: | 3, 63 |
---|
PID: | 20.500.12556/RUNG-8150 |
---|
COBISS.SI-ID: | 149321731 |
---|
DOI: | 10.26485/0459-6854/2017/67.3/1 |
---|
NUK URN: | URN:SI:UNG:REP:UJZTOZLJ |
---|
Datum objave v RUNG: | 17.04.2023 |
---|
Število ogledov: | 1977 |
---|
Število prenosov: | 0 |
---|
Metapodatki: | |
---|
:
|
Kopiraj citat |
---|
| | | Skupna ocena: | (0 glasov) |
---|
Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
---|
Objavi na: | |
---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |