Related papers: Solution to some conjectures on mobile position pr…
Given a graph $G$, the general position problem is to find a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is called a ${\rm gp}$-$set$ of $G$ and its cardinality is the ${\rm…
Gathering mobile robots is a widely studied problem in robotic research. This survey first introduces the related work, summarizing models and results. Then, the focus shifts on the open problem of gathering fat robots. In this context,…
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…
In the eternal vertex cover problem, mobile guards on the vertices of a graph are used to defend it against an infinite sequence of attacks on its edges by moving to neighbor vertices. The eternal vertex cover problem consists in…
A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number ${\rm…
We initiate the study of the parameterized complexity of the {\sc Collective Graph Exploration} ({\sc CGE}) problem. In {\sc CGE}, the input consists of an undirected connected graph $G$ and a collection of $k$ robots, initially placed at…
Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…
In this paper we study the Near-Gathering problem for a finite set of dimensionless, deterministic, asynchronous, anonymous, oblivious and autonomous mobile robots with limited visibility moving in the Euclidean plane in Look-Compute-Move…
We consider extension variants of the classical graph problems Vertex Cover and Independent Set. Given a graph $G=(V,E)$ and a vertex set $U \subseteq V$, it is asked if there exists a minimal vertex cover (resp.\ maximal independent set)…
Graph routing problems have been investigated extensively in operations research, computer science and engineering due to their ubiquity and vast applications. In this paper, we study constant approximation algorithms for some variations of…
The edge geodesic cover problem of a graph $G$ is to find a smallest number of geodesics that cover the edge set of $G$. The edge $k$-general position problem is introduced as the problem to find a largest set $S$ of edges of $G$ such that…
Let $\P$ be any collection of paths of a graph $G=(V,E)$. For $S\subseteq V$, define $I(S)=S\cup\{v\mid v \ \mbox{lies in a path of} \ \P \ \mbox{with endpoints in} \ S\}$. Let $\C$ be the collection of fixed points of the function $I$,…
An oblivious mobile robot is a stateless computational entity located in a spatial universe, capable of moving in that universe. When activated, the robot observes the universe and the location of the other robots, chooses a destination,…
In this paper, we consider the gathering problem of seven autonomous mobile robots on triangular grids. The gathering problem requires that, starting from any connected initial configuration where a subgraph induced by all robot nodes…
In this work, we study the problem of dispersion of mobile robots on dynamic rings. The problem of dispersion of $n$ robots on an $n$ node graph, introduced by Augustine and Moses Jr. [1], requires robots to coordinate with each other and…
The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric…
The general position number ${\rm gp}(G)$ of a connected graph $G$ is the cardinality of a largest set $S$ of vertices such that no three pairwise distinct vertices from $S$ lie on a common geodesic. It is proved that ${\rm gp}(G)\ge…
A general position set S is a set S of vertices in G(V,E) such that no three vertices of S lie on a shortest path in G. Such a set of maximum size in G is called a gpset of G and its cardinality is called the gp-number of G denoted by…
If $G$ is a graph and $X\subseteq V(G)$, then $X$ is a total mutual-visibility set if every pair of vertices $x$ and $y$ of $G$ admits a shortest $x,y$-path $P$ with $V(P) \cap X \subseteq \{x,y\}$. The cardinality of a largest total…
The study of mutual visibility has traditionally focused on undirected graphs, asking for the maximum number of vertices that can communicate via shortest paths without intermediate interference from other set members. In this paper, we…