1 paper
Guangfu Wang, Wenchao Cong, Chunxiao Xu
A connected graph is called ℓ1-embeddable if its shortest-path metric admits an isometric embedding into the ℓ1-space; equivalently, in the finite case, it admits a sca…