This book has been written for practitioners, researchers and students in the fields of parallel and distributed computing. Its objective is to provide detailed coverage of the applications of graph theoretic techniques to the problems of matching resources and requirements in multiple computer systems. There has been considerable research in this area over the last decade and intense work continues even as this is being written. For the practitioner, this book serves as a rich source of solution techniques for problems that are routinely encountered in the real world. Algorithms are presented in sufficient detail to permit easy implementation; background material and fundamental concepts are covered in full. The researcher will find a clear exposition of graph theoretic techniques applied to parallel and distributed computing. Research results are covered and many hitherto unpublished spanning the last decade results by the author are included. There are many unsolved problems in this field-it is hoped that this book will stimulate further research.