Active learning of convex halfspaces on graphs
We systematically study the query complexity of learning geodesically convex halfspaces on
graphs. Geodesic convexity is a natural generalisation of Euclidean convexity and allows …
graphs. Geodesic convexity is a natural generalisation of Euclidean convexity and allows …
The iteration time and the general position number in graph convexities
In this paper, we study two graph convexity parameters: iteration time and general position
number. The iteration time was defined in 1981 in the geodesic convexity, but its …
number. The iteration time was defined in 1981 in the geodesic convexity, but its …
Online learning of convex sets on graphs
We study online learning of general convex sets and halfspaces on graphs. While online
learning of halfspaces in Euclidean space is a classical learning problem, the corresponding …
learning of halfspaces in Euclidean space is a classical learning problem, the corresponding …
-Neighbor bootstrap percolation on grids
J Hedžet, MA Henning - arxiv preprint arxiv:2307.14033, 2023 - arxiv.org
Given a graph $ G $ and assuming that some vertices of $ G $ are infected, the $ r $-
neighbor bootstrap percolation rule makes an uninfected vertex $ v $ infected if $ v $ has at …
neighbor bootstrap percolation rule makes an uninfected vertex $ v $ infected if $ v $ has at …
Bootstrap percolation in strong products of graphs
B Brešar, J Hedžet - arxiv preprint arxiv:2307.06623, 2023 - arxiv.org
Given a graph $ G $ and assuming that some vertices of $ G $ are infected, the $ r $-
neighbor bootstrap percolation rule makes an uninfected vertex $ v $ infected if $ v $ has at …
neighbor bootstrap percolation rule makes an uninfected vertex $ v $ infected if $ v $ has at …
On the -Hull Number of Kneser Graphs
On the P3-hull number of Kneser graphs Page 1 On the P3-hull number of Kneser graphs
Luciano N. Grippo ∗†∗∗ Adrián Pastine ‡∗∗ Pablo Torres †§∗∗ Mario Valencia-Pabon ¶∗∗ …
Luciano N. Grippo ∗†∗∗ Adrián Pastine ‡∗∗ Pablo Torres †§∗∗ Mario Valencia-Pabon ¶∗∗ …
[HTML][HTML] On the P3-hull number of some products of graphs
Let G be a finite, simple, and undirected graph and let S be a set of vertices of G. If every
vertex having two neighbors inside S is also in S, then S is P 3-convex. The P 3-convex hull …
vertex having two neighbors inside S is also in S, then S is P 3-convex. The P 3-convex hull …
[HTML][HTML] The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
In 2-neighbourhood bootstrap percolation on a graph G, an infection spreads according to
the following deterministic rule: infected vertices of G remain infected forever and in …
the following deterministic rule: infected vertices of G remain infected forever and in …
Separation axiom for geodesic convexity in graphs
V Chepoi - arxiv preprint arxiv:2405.07512, 2024 - arxiv.org
Semispaces of a convexity space $(X, C) $ are maximal convex sets missing a point. The
separation axiom $ S_3 $ asserts that any point $ x_0\in X $ and any convex set $ A $ not …
separation axiom $ S_3 $ asserts that any point $ x_0\in X $ and any convex set $ A $ not …
Computing the hull number in toll convexity
MC Dourado - Annals of Operations Research, 2022 - Springer
A tolled walk W between vertices u and v in a graph G is a walk in which u is adjacent only to
the second vertex of W and v is adjacent only to the second-to-last vertex of W. A set S⊆ V …
the second vertex of W and v is adjacent only to the second-to-last vertex of W. A set S⊆ V …