Abstract

, and the testing algorithm can perform queries of the form: ``who is the ith neighbor of vertex v''. The tester should determine with high probability whether the graph is bipartite or e-far from bipartite for any given distance parameter e. Distance between graphs is defined to be the fraction of entries on which the graphs differ in their incidence-lists representation. Our testing algorithm has query complexity and running time \(\) where N is the number of graph vertices. It was shown before that \(\) queries are necessary (for constant e), and hence the performance of our algorithm is tight (in its dependence on N), up to polylogarithmic factors.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.