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
New Frontiers in Graph Theory
by Yagang Zhang (ed.) - InTech
The purpose of this Graph Theory book is not only to present the latest state and development tendencies of graph theory, but to bring the reader far enough along the way to enable him to embark on the research problems of his own.
(10164 views)
by Yagang Zhang (ed.) - InTech
The purpose of this Graph Theory book is not only to present the latest state and development tendencies of graph theory, but to bring the reader far enough along the way to enable him to embark on the research problems of his own.
(10164 views)
Introductory Map Theory
by 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.
(8086 views)
by 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.
(8086 views)
Intersection Graphs: An Introduction
by Madhumangal Pal - arXiv
Intersection graphs are important in both theoretical as well as application point of view. Different type of intersection graphs are defined, among them interval, circular-arc, permutation, trapezoid, chordal, disk, circle graphs are more important.
(8348 views)
by Madhumangal Pal - arXiv
Intersection graphs are important in both theoretical as well as application point of view. Different type of intersection graphs are defined, among them interval, circular-arc, permutation, trapezoid, chordal, disk, circle graphs are more important.
(8348 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.
(11753 views)
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.
(11753 views)