1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.CC2023★ 1 cited
The directed metric dimension of directed co-graphs
Yannick Schmitz, Egon Wanke
A vertex resolves two vertices and in a directed graph if the distance from to is different to the distance from to . A set of vertices is a reso…
cs.CC2022
On the strong metric dimension of composed graphs
Marcel Wagner, Yannick Schmitz, Egon Wanke
Two vertices and of an undirected graph are strongly resolved by a vertex if there is a shortest path between and containing or a shortest path between…
cs.CC2021★ 1 cited
A note on the complexity of k-Metric Dimension
Yannick Schmitz, Duygu Vietz, Egon Wanke
Two vertices of an undirected connected graph are resolved by a vertex if the distance between and and the distance between and are diffe…