Digital repository of Slovenian research organisations

Search the repository
A+ | A- | Help | SLO | ENG

Query: search in
search in
search in
search in

Options:
  Reset


Query: "keywords" (k-center) .

1 - 4 / 4
First pagePrevious page1Next pageLast page
1.
Generalized Pell graphs
Vesna Iršič, Sandi Klavžar, Elif Tan, 2023, original scientific article

Abstract: In this paper, generalized Pell graphs $\Pi_{n,k}$, $k\ge 2$, are introduced. The special case of $k=2$ are the Pell graphs $\Pi_{n}$ defined earlier by Munarini. Several metric, enumerative, and structural properties of these graphs are established. The generating function of the number of edges of $\Pi_{n,k}$ and the generating function of its cube polynomial are determined. The center of $\Pi_{n,k}$ is explicitly described; if $k$ is even, then it induces the Fibonacci cube $\Gamma_{n}$. It is also shown that $\Pi_{n,k}$ is a median graph, and that $\Pi_{n,k}$ embeds into a Fibonacci cube.
Keywords: Fibonacci cubes, Pell graphs, generating functions, center of graph, median graphs, k-Fibonacci sequence
Published in DiRROS: 08.04.2024; Views: 94; Downloads: 38
.pdf Full text (345,71 KB)
This document has many files! More...

2.
Faster distance-based representative skyline and k-center along pareto front in the plane
Sergio Cabello, 2023, original scientific article

Abstract: We consider the problem of computing the distance-based representative skyline in the plane, a problem introduced by Tao, Ding, Lin and Pei and independently considered by Dupin, Nielsen and Talbi in the context of multi-objective optimization. Given a set $P$ of $n$ points in the plane and a parameter $k$, the task is to select $k$ points of the skyline defined by $P$ (also known as Pareto front for $P$) to minimize the maximum distance from the points of the skyline to the selected points. We show that the problem can be solved in $O(n \log h)$ time, where $h$ is the number of points in the skyline of $P$. We also show that the decision problem can be solved in $O(n \log k)$ time and the optimization problem can be solved in $O(n \log k + n \log\log n)$ time. This improves previous algorithms and is optimal for a large range of values of $k$.
Keywords: geometric optimization, skyline, pareto front, clustering, k-center
Published in DiRROS: 15.03.2024; Views: 89; Downloads: 44
.pdf Full text (2,13 MB)
This document has many files! More...

3.
Prvi koraki vzpostavitve Centra za semenarstvo, drevesničarstvo in varstvo gozdov
Simon Zidar, Barbara Piškur, Hojka Kraigher, Tjaša Baloh, Primož Simončič, 2022, popular article

Keywords: Center za semenarstvo, drevesničarstvo in varstvo gozdov, gozdarstvo, raziskovanje
Published in DiRROS: 20.02.2023; Views: 485; Downloads: 98
.pdf Full text (151,13 KB)

4.
Gozdni in lovski pedagogi na ogledu avstrijskega lovsko izobraževalnega centra Werkstatt Natur
Špela Planinšek, 2018, popular article

Keywords: lovstvo, Avstrija, lovski izobraževalni center
Published in DiRROS: 23.12.2018; Views: 2956; Downloads: 690
.pdf Full text (267,11 KB)
Search done in 0.1 sec.
Back to top