Computational Graph Theory (COMPUTING (SPRINGER-VERLAG) SUPPLEMENTUM)

Contents:
Efficient Computations in Tree-Like Graphs.- Graph Problems Related to Gate Matrix Layout and PLA Folding.- Planar Graph Problems.- Basic Parallel Algorithms in Graph Theory.- Applications of Parallel Scheduling Algorithms to Families of Perfect Graphs.- Orders and Graphs.- Dynamic Partial Orders and Generalized Heaps.- Communication Complexity.- Path Problems in Graphs.- Heuristics for Graph Coloring.- Probabilistic Analysis of Graph Algorithms.- Generating Graphs Uniformly at Random.- Embedding one Interconnection Network in Another.