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
Advanced Graph Theory and Combinatorial Optimizationby 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.
(11016 views)
Introductory Map Theoryby Yanpei Liu - Kapa & Omega
As an introductory book, this book contains the elementary materials in map theory, including embeddings of a graph, abstract maps, duality, orientable and non-orientable maps, isomorphisms of maps and the enumeration of rooted or unrooted maps.
(7531 views)
Graph Theoryby Keijo Ruohonen - Tampere University of Technology
These lecture notes form the base text for a Graph Theory course. The text contains an introduction to basic concepts and results in graph theory, with a special emphasis put on the network-theoretic circuit-cut dualism.
(10786 views)
Probability on Trees and Networksby Russell Lyons, Yuval Peres - Cambridge University Press
This book is concerned with certain aspects of discrete probability on infinite graphs that are currently in vigorous development. Of course, finite graphs are analyzed as well, but usually with the aim of understanding infinite graphs and networks.
(5999 views)