OPTIMAL RANDOMIZED PARALLEL ALGORITHM FOR FINDING CONNECTED COMPONENTS IN A GRAPH.

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1986, Pages 492-501

  Gazit, Hillel ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

CONNECTIVITY ALGORITHM; OPTIMAL RANDOMIZED PARALLEL ALGORITHM; PARALLEL RANDOMIZED ACCESS MACHINE (PRAM);

COMPUTER SYSTEMS, DIGITAL;

EID: 0022877555     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1986.9     Document Type: Conference Paper

References (6)