Abstract
STAGNI, Henrique. Property Testing in Tournaments Thesis — Instituto de Matematica e Estatistica, Universidade de Sao Paulo, Sao Paulo, 2014. Graph property testing is the study of randomized sublinear algorithms which decide if an input graph G with n vertices satisfies a given property or if it is necessary to add or remove more than ( n 2 ) edges to make G satisfy it, for some fixed error parameter . A graph property P is called testable if, for every > 0, there is such an algorithm for P whose run time is independent of n. One of the most important results in this area is due to Alon and Shapira, who showed that every hereditary graph property is testable. In this work, we show analogous results for tournaments — complete graphs in which every edge is given an orientation.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
