Login / Signup

Tight Bounds for Testing Bipartiteness in General Graphs.

Tali KaufmanMichael KrivelevichDana Ron
Published in: RANDOM-APPROX (2003)
Keyphrases
  • tight bounds
  • upper bound
  • special case
  • closely related
  • data sets
  • information retrieval
  • test cases
  • graph theoretic
  • real time
  • data mining
  • machine learning
  • multiscale
  • evolutionary algorithm
  • graph theory