The Shortest Augmenting Paths for Online Matchings on Trees. Bosek, B., Leniowski, D., Zych, A., & Sankowski, P. CoRR, 2017.
The Shortest Augmenting Paths for Online Matchings on Trees [link]Paper  bibtex   
@article{DBLP:journals/corr/BosekLZS17,
  author    = {Bartlomiej Bosek and
               Dariusz Leniowski and
               Anna Zych and
               Piotr Sankowski},
  title     = {The Shortest Augmenting Paths for Online Matchings on Trees},
  journal   = {CoRR},
  volume    = {abs/1704.02093},
  year      = {2017},
  url       = {http://arxiv.org/abs/1704.02093},
  eprinttype = {arXiv},
  eprint    = {1704.02093},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BosekLZS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0