On the Complexity of Sorted Neighborhood. Kejriwal, M. & Miranker, D. P. CoRR, 2015.
On the Complexity of Sorted Neighborhood [link]Paper  bibtex   
@article{DBLP:journals/corr/KejriwalM15a,
  author    = {Mayank Kejriwal and
               Daniel P. Miranker},
  title     = {On the Complexity of Sorted Neighborhood},
  journal   = {CoRR},
  volume    = {abs/1501.01696},
  year      = {2015},
  url       = {http://arxiv.org/abs/1501.01696},
  eprinttype = {arXiv},
  eprint    = {1501.01696},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/KejriwalM15a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0