1 citations · 2 across the 7 of their papers we have counts for
1 paper · 1 filter
Sepp Hartung, André Nichterlein
The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in…