{"id":"W2037298352","doi":"10.1016/s0166-218x(00)00198-0","title":"Resolvability in graphs and the metric dimension of a graph","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":982,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Graph; Connectivity; Dimension (graph theory); Discrete mathematics; Line graph; Pathwidth","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009040591071365865,"score_gpt":0.2191411440438341,"score_spread":0.2101005529724683,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}