The current exponential growth in graph data has forced a shift to parallel computing for executing graph algorithms. Implementing parallel graph algorithms and

Revised throughout Includes new chapters on the network simplex algorithm and a section on the five color theorem Recent developments are discussed

Algorithms are a dominant force in modern culture, and every indication is that they will become more pervasive, not less. The best algorithms are undergirded b

Generalities about graphs. The shortest path problem in a graph. Path algebras. Trees and arborescences. Flows and transportation networks. Flows with gains. Mu

When reality is modeled by computation, matrices are often the connection between the continuous physical world and the finite algorithmic one. Usually, the mor