EULERIAN & HAMILTONIAN
-
Eulerian at wikipedia
-
7 bridges of Koningsberg
-
A Eulerian lesson
-
A Eulerian lecture
-
Chinese Postman problem
-
An overview of CPP
-
An introduction to CPP
-
An introduction to H & E circuits
-
Hamiltonian at wikipedia
-
Route inspection problem
-
TSP at wikipedia
-
Hamiltonian at mathworld
-
The TSP portal
-
Another TSP
-
Another Hamiltonian
-
My 101 notes
BFS, DFS, SHORTEST PATH:
-
UC Urvine's BFS&DFS
-
DFS at wikipedia
-
A DFS ppt
-
Tree traversals from u.waterloo
-
Shortest path problem at wikipedia
-
Shortest path problem at mathworld
-
Shortest Path Problem Web Pages
Combinatorics:
-
wikipedia is the best!
-
discrete mathematics summary
-
topics in combinatorics
-
another book: Combinatorics: Topics, Techniques, Algorithms
-
another hypertext: enumerative combinatorics
-
a chapter on combinatorics
-
MIT open courseware: Combinatorial Analysis
-
MIT open courseware: The art of counting
GRAPH PARTITIONING
-
Graph partitioning at wikipedia
-
Graph partitioning at Stony Brook
-
Graph partitioning at Berkeley
-
A concise page on graph partitioning
-
Algorithms and Software for Partitioning Graphs
-
Kernighan & Lin heuristic
-
Fiduccia & Mattheyses heuristic
-
A multiple-way partitioning algorithm
-
PARTY Partitioning Library
-
CHACO Partitioning Library
-
METIS Partitioning Library
-
SCOTCH Partitioning Library
SPANNING & STEINER TREES
-
Steiner Tree at wikipedia
-
Steiner Tree Problem's Heuristic with Minimum Spanning Tree Problem
-
Steiner Tree at sunysb
-
A ppt for Steiner Tree
-
Steiner and Spanning Trees
-
Steiner Tree at NationMaster
-
Minimum Spanning Tree
-
Prim's and Kruskal's algorithms
-
Minimum Spanning Tree at wikipedia
-
Kruskal's algorithm at wikipedia
-
Prim's algorithm at wikipedia
-
A Catalog of Steiner Tree Formulations
DYNAMIC PROGRAMMING:
-
DP at wikipedia
-
DP at 20bits
-
Trick's Tutorial on DP
-
Another tutorial
-
A chapter on DP from Berkeley
-
A DP course lecture notes from Cambridge