5 citations · 13 across the 9 of their papers we have counts for
11 papers
Solid-Resolving Sets on Directed Graphs
Anni Hakanen, Pavan P D
A set is a solid-resolving set of an undirected graph if each vertex can be distinguished from any vertex subset by their distances from the set . Solid-r…
On the Maximum Number of Vertices that Belong to Every Metric Basis
Anni Hakanen, Ville Junnila, Tero Laihonen +2
Metric bases of graphs have been widely studied since their introduction in the 1970's by Slater and, independently, by Harary and Melter. In this paper, we concentrate on the exis…
Shortest paths in planar domains with hyperbolic type metrics
Shuliang Gao, Anni Hakanen, Antti Rasila +1
We study planar domains equipped with a hyperbolic type metric and approximate geodesics that join two points and their lengths. We present an algorithm that enable…
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to…
The -bound for locating-dominating sets in subcubic graphs
Dipayan Chakraborty, Anni Hakanen, Tuomo Lehtilä
The location-domination number is conjectured to be at most half of the order for twin-free graphs with no isolated vertices. We prove that this conjecture holds and is tight for s…
Algorithms and hardness for Metric Dimension on digraphs
Antoine Dailly, Florent Foucaud, Anni Hakanen
In the Metric Dimension problem, one asks for a minimum-size set of vertices such that for any pair of vertices of the graph, there is a vertex from whose two distances to…
Complexity and equivalency of multiset dimension and ID-colorings
Anni Hakanen, Ismael G. Yero
This investigation is firstly focused into showing that two metric parameters represent the same object in graph theory. That is, we prove that the multiset resolving sets and the…
Progress towards the two-thirds conjecture on locating-total dominating sets
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen +2
We study upper bounds on the size of optimum locating-total dominating sets in graphs. A set of vertices of a graph is a locating-total dominating set if every vertex of $G…
On the unicyclic graphs having vertices that belong to all their (strong) metric bases
Anni Hakanen, Ville Junnila, Tero Laihonen +1
A metric basis in a graph is a smallest possible set of vertices of , with the property that any two vertices of are uniquely recognized by using a vector of distanc…
On Vertices Contained in All or in No Metric Basis
Anni Hakanen, Ville Junnila, Tero Laihonen +1
A set is a resolving set of a graph if for all distinct vertices there exists an element such that . The metric…
On the Metric Dimensions for Sets of Vertices
Anni Hakanen, Ville Junnila, Tero Laihonen +1
Resolving sets were originally designed to locate vertices of a graph one at a time. For the purpose of locating multiple vertices of the graph simultaneously, -resolving…