Yannick Schmitz

activity

20212023

most citedA note on the complexity of k-Metric Dimension

1 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.CC2021

On the Strong Metric Dimension of directed co-graphs

Yannick Schmitz, Egon Wanke

Let $G$ be a strongly connected directed graph and $u, v, w \in V (G)$ be three vertices. Then $w$ strongly resolves $u$ to $v$ if there is a shortest $u$ - $w$ -path containing $v$ or a…

cs.CC2021★ 1 cited

A note on the complexity of k-Metric Dimension

Yannick Schmitz, Duygu Vietz, Egon Wanke

Two vertices $u, v \in V$ of an undirected connected graph $G = (V, E)$ are resolved by a vertex $w$ if the distance between $u$ and $w$ and the distance between $v$ and $w$ are diffe…