We show that if a graph G admits a quasi-isometry ϕ to a graph H of bounded path-width, then we can assign a non-negative integer length to each edge of H, such that the same function ϕ is a quasi-isometry to this weighted version of H, with error only an additive constant.
Nguyen et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: