Egon Wanke

activity

20162023

most citedA note on the complexity of k-Metric Dimension

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

collaborators

7 papers

cs.CC2023★ 1 cited

The directed metric dimension of directed co-graphs

Yannick Schmitz, Egon Wanke

A vertex $w$ resolves two vertices $u$ and $v$ in a directed graph $G$ if the distance from $w$ to $u$ is different to the distance from $w$ to $v$ . A set of vertices $R$ is a reso…

cs.CC2022

On the strong metric dimension of composed graphs

Marcel Wagner, Yannick Schmitz, Egon Wanke

Two vertices $u$ and $v$ of an undirected graph $G$ are strongly resolved by a vertex $w$ if there is a shortest path between $w$ and $u$ containing $v$ 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 $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.DM2020

Computing Directed Steiner Path Covers

Frank Gurski, Dominique Komander, Carolin Rehs +2

In this article we consider the Directed Steiner Path Cover problem on directed co-graphs. Given a directed graph G=(V,E) and a subset T of V of so-called terminal vertices, the pr…

cs.DS2019

The Fault-Tolerant Metric Dimension of Cographs

Duygu Vietz, Egon Wanke

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

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…