Stefan S. Dantchev, Tom Friedetzky, Lars Nagel. Sublinear-Time Algorithms for Tournament Graphs. In Hung Q. Ngo, editor, Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings. Volume 5609 of Lecture Notes in Computer Science, pages 459-471, Springer, 2009. [doi]
@inproceedings{DantchevFN09,
title = {Sublinear-Time Algorithms for Tournament Graphs},
author = {Stefan S. Dantchev and Tom Friedetzky and Lars Nagel},
year = {2009},
doi = {10.1007/978-3-642-02882-3_46},
url = {http://dx.doi.org/10.1007/978-3-642-02882-3_46},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DantchevFN09},
cites = {0},
citedby = {0},
pages = {459-471},
booktitle = {Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings},
editor = {Hung Q. Ngo},
volume = {5609},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-02881-6},
}