• DocumentCode
    3182656
  • Title

    Lower bounds for testing bipartiteness in dense graphs

  • Author

    Bogdanov, Andrej ; Trevisan, Luca

  • Author_Institution
    Comput. Sci. Div., California Univ., Berkeley, CA, USA
  • fYear
    2004
  • fDate
    21-24 June 2004
  • Firstpage
    75
  • Lastpage
    81
  • Abstract
    We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and graphs that are ε-far from bipartite using 0(1/ε2) queries. We show that this is optimal for non-adaptive algorithms, up to polylogarithmic factors. We also show a lower bound of Ω(1/ε32/) for adaptive algorithms.
  • Keywords
    computational complexity; graph theory; 0(1/ε2) queries; adaptive algorithm; adjacency matrix model; bipartite graphs; dense graph; graph bipartiteness testing; lower bound; nonadaptive algorithm; polylogarithmic factor; Adaptive algorithm; Bipartite graph; Computational complexity; Computer errors; Computer science; Polynomials; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2004. Proceedings. 19th IEEE Annual Conference on
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-2120-7
  • Type

    conf

  • DOI
    10.1109/CCC.2004.1313803
  • Filename
    1313803
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3182656