APPROXIMATE AND EXACT PARALLEL SCHEDULING WITH APPLICATIONS TO LIST, TREE AND GRAPH PROBLEMS.

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1986, Pages 478-490

  Cole, Richard ^a   Vishkin, Uzi ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; MATHEMATICAL TECHNIQUES - GRAPH THEORY; SCHEDULING;

BICONNECTIVITY; CONNECTIVITY; MINIMUM SPANNING-TREE PROBLEMS; PARALLEL RANDOM ACCESS MACHINE (PRAM); PARALLEL SCHEDULING PROBLEMS;

COMPUTER SYSTEMS, DIGITAL;

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

References (18)