2 citations · 4 across the 20 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.CC2026
On the Hardness of Strong Metric Dimension
Prafullkumar Tale
Let \(G\) be a connected simple undirected graph. A vertex \(w\) is said to \emph{strongly resolve} a pair of distinct vertices \(u, v \in V(G)\) if either there exists an isometri…
cs.DS2026
Structural parameterizations of Geodetic Set on directed (acyclic) graphs
Laurent Beaudou, Florent Foucaud, Lucas Lorieau +1
In DIRECTED GEODETIC SET, we are given a (directed) graph and seek a small solution set such that every vertex lies on a shortest directed path between two verti…