Sort by: Order: Results:

  • Galby, Esther; Khazaliya, Liana; Inerney, Fionn Mc; Sharma, Roohani; TALE, PRAFULLKUMAR (Society for Industrial and Applied Mathematics, 2023)
    For a graph G , a subset S⊆V(G) is called a resolving set if for any two vertices u, v∈ V (G) , there exists a vertex w ∈ S such that d(w,u)≠d(w,v) . The METRIC DIMENSION problem takes as input a graph G and a positive ...