Link collection Graph Algorithms
General / Basics
Introductionary sources:
- Graphs from
Mathworld [Mathworld]: a brief definition with examples
- Graph Theory [Wikipedia Encyclopedia]: definitions in graph theory
- Graphs and Algorithms [Webpearls principles and practice of Mathmatics]
: a general website explains most of the famous graph theory concepts
- Design and analysis of Algorithms [University of Texas at Arlington]: a whole university course discussing nearly everything concerning graphs and algorithms
- Graphs
[Rochester Institute of Technology]: explanation of the
basic concepts about graphs, breadth-first search, depth-first search, and
many other basic problems (good for beginners)
- Review of Elementary Graph Theory
[Boost.org]: good site for beginners explaining all the basic concepts of graph theory
Advanced sources:
Supplementary useful sources:
- Data Structures [Sussex University]: starts from the basic data structures like arrays, stacks,... and continues till graphs and their algorithms.
- Dictionary of Algorithms and Data Structures [National institute of standards and technology]: a dictionary for the vocabulary of graph theory.
-
Win-Prolog Goodies [Private Webpage]: implementations
in Prolog for most of the combinatorial algorithms including TSP and many
others.
- The Stony Brook Algorithm Repository [Stoony Brook University New York]: a very big website containing useful theoretical definitions and implementations in many languages like: C++, C, Java, Fortran, and others.
Applets and Animations:
- Graph Algorithms Animations [Algorithm Animation Tool ANIMAL]: animation of many algorithms like BFS, DFS, Dijkstra shortest path algorithm, and others.
- Graph Algorithms Applet [University of California Berkeley]: a compact applet for creating and editing graphs.
Traveling Salesman Problem (TSP)
Introductionary sources:
Applets and Animations:
Hamiltonian Cycle:
Routing Problems
- A Survey of Arc Routing Problems [University of Heidelberg]: a very detailed discussion of nearly
all the routing problems including literature and links.
- Gruppenunterricht zum Thema Routing-Algorithmen [Eidgenössische Technische Hochschule Zürich]: a complete report about routing alogrithms from an engineering point of view (in German)
- Planning Algorithms [University of Illinois]: a complete website about planning algorithms, from the definition to the complicated problems, includes a book.
- Routing problems [The sweedish royal institute of Technology]: formal description ofthe famous routing problems also including literature and links.
- Routing in computer and telephone networks [Rensselaer Polytechnic Institute]: the basic concepts about routing are explained and an application is
considered.
Chinese Postman Problem:
Shortest Path Problems
Graph Coloring Problems
Matching Problems
- Bipartite Matching [Duke University]: a definition of a matching problem, MIN-CUT MAX-FLOW, FORD-FULKERSON method, etc. with some literature links
- Matching Algorithms [Algorithmicsolutions.info]: some basic concepts of matching, also its relation with Bipartite graphs.
Minimum Spanning Tree Problems
Erstellt von Maximus G. Haddad und Sigrid Knust, 29.06.04