Repozitorij Univerze v Novi Gorici

Iskanje po repozitoriju
A+ | A- | Pomoč | SLO | ENG

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 3 / 3
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
L (D, 2, 1)-labeling of Square Grid
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2019, izvirni znanstveni članek

Opis: For a fixed integer $D (\geq 3)$ and $\lambda$ $\in$ $\mathbb{Z}^+$, a $\lambda$-$L(D, 2, 1)$-$labeling$ of a graph $G = (V, E)$ is the problem of assigning non-negative integers (known as labels) from the set $\{0, \ldots, \lambda\}$ to the vertices of $G$ such that if any two vertices in $V$ are one, two and three distance apart from each other then the assigned labels to these vertices must have a difference of at least $D$, 2 and 1 respectively. The vertices which are at least $4$ distance apart can receive the same label. The minimum value among all the possible values of $\lambda$ for which there exists a $\lambda$-$L(D, 2, 1)$-$labeling$ is known as the labeling number. In this paper $\lambda$-$L(D, 2 ,1)$-$labeling$ of square grid is considered. The lower bound on the labeling number for square grid is presented and a formula for $\lambda$-$L(D, 2 ,1)$-$labeling$ of square grid is proposed. The correctness proof of the proposed formula is given here. The upper bound of the labeling number obtained from the proposed labeling formula for square grid matches exactly with the lower bound of the labeling number.
Ključne besede: Graph labeling, Square grid, Labeling number, Frequency assignment problem (FAP)
Objavljeno v RUNG: 17.04.2023; Ogledov: 699; Prenosov: 0
Gradivo ima več datotek! Več...

2.
No-hole λ-L (k, k – 1, …, 2,1)-labeling for square grid
Soumen Atta, Stanisław Goldstein, Priya Ranjan Sinha Mahapatra, 2017, izvirni znanstveni članek

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
Objavljeno v RUNG: 17.04.2023; Ogledov: 691; Prenosov: 0
Gradivo ima več datotek! Več...

3.
Least-square fit : written report
Aleksander Đorđević, 2021, raz. nal. na višji ali visoki šoli

Ključne besede: least-square fit, non-linear regression, Levenberg-Marquardt algorithm
Objavljeno v RUNG: 28.06.2021; Ogledov: 2130; Prenosov: 0
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.02 sek.
Na vrh