An introduction to graph algorithms and pure graph theory with applications to computer systems. Emphasizing understanding, design, specification and performance, this book provides wide-ranging coverage of algorithms and algorithmic techniques. The author considers recent advances in random and parallel algorithms and includes numerous examples of graph-theoretic modelling. He also presents algorithms using current standards for software specification. He then examines new random and parallel graph processing algorithms, including those on different parallel architectures as well as many shared memory algorithms. There is then coverage of design techniques and design methods, such as divide and conquer and search tree techniques throughout. Finally, the book explores the elements of pure graph theory with exercises covering both graph-theoretical and algorithmic topics.
"Sinopsis" puede pertenecer a otra edición de este libro.
Descripción Prentice Hall, 1989. Hardcover. Estado de conservación: New. Never used!. Nº de ref. de la librería P110130236152
Descripción Prentice Hall, 1989. Hardcover. Estado de conservación: New. Nº de ref. de la librería DADAX0130236152