Duygu Vietz

activity

20182021

most citedA note on the complexity of k-Metric Dimension

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

collaborators

Showing cs.CCShow all

2 papers · 1 filter

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…

cs.CC2018

Computing the metric dimension by decomposing graphs into extended biconnected components

Duygu Vietz, Stefan Hoffmann, Egon Wanke

A vertex set $U \subseteq V$ of an undirected graph $G = (V, E)$ is a $resolving set$ for $G$ , if for every two distinct vertices $u, v \in V$ there is a vertex $w \in U$ such…