**Algorithmic Graph Theory**

by David Joyner, Minh Van Nguyen, Nathann Cohen

**Publisher**: Google Code 2010**Number of pages**: 105

**Description**:

This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software. Contents: Introduction to Graph Theory; Graph Algorithms; Trees and Forests; Distance and Connectivity; Optimal Graph Traversals; Planar Graphs; Graph Coloring; Network Flows; Random Graphs; Graph Problems and Their LP Formulations.

Download or read it online for free here:

**Download link**

(760KB, PDF)

## Similar books

**Digraphs: Theory, Algorithms and Applications**

by

**Jorgen Bang-Jensen, Gregory Gutin**-

**Springer**

Digraphs presents a comprehensive survey of the study of directed graphs. It covers theoretical aspects with detailed proofs, and some algorithms and applications. The essential textbook and reference for graduate students and researchers.

(

**12913**views)

**Lecture Notes on Graph Theory**

by

**Tero Harju**-

**University of Turku**

These are introductory lecture notes on graph theory. Contents: Introduction (Graphs and their plane figures, Subgraphs, Paths and cycles); Connectivity of Graphs; Tours and Matchings; Colourings; Graphs on Surfaces; Directed Graphs.

(

**10815**views)

**Advanced Graph Theory and Combinatorial Optimization**

by

**Alexander Schrijver**

From the table of contents: Shortest trees and branchings; Matchings and covers; Edge-colouring; Multicommodity flows and disjoint paths; Matroids; Perfect matchings in regular bipartite graphs; Minimum circulation of railway stock.

(

**7000**views)

**Graph Theory**

by

**Reinhard Diestel**-

**Springer**

Textbook on graph theory that covers the basics, matching, connectivity, planar graphs, colouring, flows, substructures in sparse graphs, Ramsey theory for graphs, hamiltonian cycles, random graphs, minors, trees, and WQO.

(

**14052**views)