Skip to main content

1 Result(s)

within Antoine Dailly Remove this filter Computer Science 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)