Efficient testing of large graphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 656-666

  Alon, Noga ^a   Krivelevich, Michael ^a   Fischer, Eldar ^a   Szegedy, Mario ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONS; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

COMBINATORIAL LEMMA; RANDOMIZED ALGORITHM;

GRAPH THEORY;

EID: 0032607562     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)