Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)

Sara Bourbour, Dinesh P. Mehta, William C. Navidi. Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST). Networks, 76(3):402-413, 2020. [doi]

@article{BourbourMN20,
  title = {Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)},
  author = {Sara Bourbour and Dinesh P. Mehta and William C. Navidi},
  year = {2020},
  doi = {10.1002/net.21949},
  url = {https://doi.org/10.1002/net.21949},
  researchr = {https://researchr.org/publication/BourbourMN20},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {76},
  number = {3},
  pages = {402-413},
}