Google Code Archive - Long-term storage for Google Code Project Hosting.
source link: https://code.google.com/archive/p/graphbook/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
A book on algorithmic graph theory
A GNU-FDL book on algorithmic graph theory by David Joyner, Minh Van Nguyen, and David Phillips. This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software. To get an overview of the book, you can view the table of contents as shown below or download the complete book. This book is more commonly known as the "DaMNeD" book if you notice how our names are used to abbreviate the book. So feel free to call it the DaMNeD book :-)
Supplementary materials for the book can be found at https://bitbucket.org/mvngu/graphbook-supplement.
A companion book is Explorations in Algebraic Graph Theory with Sage. This book covers how to use techniques from algebra to analyze many types of graphs.
The book is a work in progress; it is by no means complete yet. We as the authors work on it during our spare time. If you want to help out by contributing materials, that would be awesome and greatly appreciated.
The latest revision of the book is called latest-rxxx.
Introduction to graph theory
- Graphs and digraphs
- Subgraphs and other graph types
- Representing graphs in a computer
- Graph transformation
- Isomorphic graphs
- New graphs from old
Trees and forests
- Properties of trees
- Minimum spanning trees
- Binary trees
- Huffman codes
- Tree traversals
Shortest paths algorithms
- Distance labels
- Searching graphs
- Bellman-Ford algorithm
- Dijkstra's algorithm
- Topological sort
- All-pairs shortest paths
Graph data structures
- Priority queues
- Binary heaps
- Binomial heaps
- Binary search trees
Distance and connectivity
- Path and distance
- Vertex and edge connectivity
- Menger’s theorem
- Network reliability
Centrality and prestige
- Vertex centrality
- Edge centrality
- Ranking web pages
- Hub and authority
Optimal graph traversals
- Eulerian graphs
- Hamiltonian graphs
- Chinese postman problem
- Traveling salesman problem
Graph coloring
- Vertex coloring
- Edge coloring
- Chromatic polynomial
- Assignment and scheduling
Maximum flow problems
- Flows and cuts
- Ford-Fulkerson theorem
- Edmonds-Karp algorithm
- Goldberg-Tarjan algorithm
- Path-flow decomposition
- Maximum weight closure
Algebraic graph theory
- Laplacian and adjacency matrices
- Eigenvalues and eigenvectors
- Algebraic connectivity
- Graph invariants
- Cycle and cut spaces
Random networks
- Network statistics
- Binomial random networks
- Erdos-Renyi networks
- Small-world networks
- Scale-free networks
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK