Skip to main content

2 Result(s)

within Anni Hakanen Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Algorithms and Hardness for Metric Dimension on Digraphs

    In the Metric Dimension problem, one asks for a minimum-size set R of vertices such that for any pair of vertices of the graph, there is a vertex from R whose two distances to the vertices of the pair are distinc...

    Antoine Dailly, Florent Foucaud… in Graph-Theoretic Concepts in Computer Scien… (2023)

  2. No Access

    Chapter and Conference Paper

    Distance-Based Covering Problems for Graphs of Given Cyclomatic Number

    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 be removed from the graph to ...

    Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen in Fundamentals of Computation Theory (2023)