Skip to main content

2 Result(s)

within Antoine Dailly Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Resolving Sets in Temporal Graphs

    A resolving set R in a graph G is a set of vertices such that every vertex of G is uniquely identified by its distances to the vertices of R. Introduced in the 1970’s, this concept has been since then extensively...

    Jan Bok, Antoine Dailly, Tuomo Lehtilä in Combinatorial Algorithms (2024)

  2. 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)