Graph-theoretic techniques for parallel, distributed, and sequential computation
Serge A. Plotkin · Massachusetts Institute of Technology eBooks · 1988
Abstract : Parallel computation presents problems which are either nonexistent or trivial in the context of sequential computation. Thus, design of efficient algorithms for parallel and distributed computation requires development of new tools and techniques. This thesis considers a number of fundamental problems that arise in the context of parallel and distributed computation and describes several graph-theoretic techniques to address these problems. It also presents several new insights into the structure of various combinatorial optimization problems.