An Optimal Algorithm to Find Champions of Tournament Graphs.
Lorenzo Beretta|Franco Maria Nardini|Roberto Trani|Rossano Venturini
| Anthology ID: | DBLP:conf/spire/BerettaNTV19 |
|---|---|
| Volume: | String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings |
| Year: | 2019 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 267-273 |
| URL: | https://doi.org/10.1007/978-3-030-32686-9_19 |
| DOI: | https://doi.org/10.1007/978-3-030-32686-9_19 |
| DBLP: | conf/spire/BerettaNTV19 |
| BibTeX: |
@inproceedings{beretta-2019-optimal,
author = {Lorenzo Beretta and
Franco Maria Nardini and
Roberto Trani and
Rossano Venturini},
editor = {Nieves R. Brisaboa and
Simon J. Puglisi},
title = {{An Optimal Algorithm to Find Champions of Tournament Graphs}},
booktitle = {{String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {11811},
pages = {267--273},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-32686-9_19},
doi = {https://doi.org/10.1007/978-3-030-32686-9_19}
}