What do you think?
Rate this book
Computational Graph Theory
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.
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.
282 pages, Paperback
First published April 20, 1990
3 people want to read
About the author
Gottfried Tinhofer
8 booksGottfried Tinhofer
Ph.D. Universität Innsbruck 1966 Austria
Dissertation: Untersuchungen über allgemeine Kreisscharen in der ebenen Geometrie von Lie
Ph.D. Universität Innsbruck 1966 Austria
Dissertation: Untersuchungen über allgemeine Kreisscharen in der ebenen Geometrie von Lie
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
No one has reviewed this book yet.