Egon Wanke

activity

20162026

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 cs.DSShow all

2 papers · 1 filter

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.DS2016

Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels

Stefan Hoffmann, Egon Wanke

This paper examines the problem of assigning a transmission power to every node of a wireless sensor network. The goal is to minimize the total power consumption while ensuring tha…