ÀÌ»ê¼öÇп¡¼­ÀÇ counting°ú graphÀ̷п¡ °üÇÑ ¿¬½À¹®Á¦´Â ´ÙÀ½À» clickÇϸé ãÀ» ¼ö ÀÖ½À´Ï´Ù.

 

 

 

 

ÀÌ»ê¼öÇп¡¼­ÀÇ È®·ü·Ð¿¡ °üÇÑ °­ÀÇ Âü°í ÀÚ·á¿Í ¿¬½À¹®Á¦´Â ´ÙÀ½À» clickÇϰųª ¶Ç´Â ´ÙÀ½À» clickÇϸé ãÀ» ¼ö ÀÖ½À´Ï´Ù.

 

 

 

 

ÀÌ»ê¼öÇп¡¼­ÀÇ ¼ø¿­°ú Á¶ÇÕ¿¡ °üÇÑ °­ÀÇ Âü°í ÀÚ·á¿Í ¿¬½À¹®Á¦´Â ´ÙÀ½À» clickÇϸé ãÀ» ¼ö ÀÖ½À´Ï´Ù.

 

 

 

 

 

 

Algorithms Course Materials on the Net,by Kirk Pruhs, University of Pittsburgh

This is a list of links to courses, many of which have relevant notes you can see to supplement our text, particulary on fundamental graph algorithms, such as for the minimum spanning tree.

 

 

 

 

Concise Tutorial on Finite Automata, by Roberto Giovannetti, University of Milan

    This offers a nice tutorial, relevant to Chapter 10, and you can get AUTOMATA software (free).

 

 

Dijkstra's Shortest Path Algorithm Animation in Java, by Carla Laffra

    This allows you to step through Dijkstra's shortest path algorithm (Chapter 7). Begin with the example, then you can create your own network. Source code is also provided.

 

 

Discrete Math, by Jennifer D. Jones, University of Oregon

    This has interesting materials, although it is one year old. Check the glossary of terms by clicking on the author's icon:

 

 

 

 

 

Discrete Math - CS22 at Brown University

    This has some notes and homework problems. Look at Handoout 1: Proof Techniques. Homework 1 doesn't have our topics, but it has fallacious ``proofs'' of some geometry statements.

 

 

 

 

Free On-Line Dictionary of Computing, by Denis Howe

    This has evolved into the premier dictionary on computer science. Lookup some terms, starting with ``relation''.

 

 

Graph Drawing, German National Science Foundation Research Center

    This is beyond our course, but as a computer scientist, you might appreciate their software developments.

 

 

 

 

 

Graph Theory Tutorials, by Chris K. Caldwell, University of Tennessee at Martin

    This has three tutorials: Introduction to Graph Theory, Euler Circuits and Paths, and Coloring Problems. In addition, there are links to related resources.

 

 

 

 

Graphs: Theory - Algorithms - Complexity, by Thomas Emden-Weinert, Humboldt University

    If you get interested in graph theory, this has lots of links of interest.

 

 

 

MathMania - Graph Theory

    This has tutorials, exercises, a glossary, and more.

 

 

 

 

 

MEGA Mathematics, from Los Alamos National Lab.

    Check the ``Games on Graphs'' and ``Machines that eat your words.'' The former has some basic terms and concepts; the latter is about finite state machines (Chapter 10 in text).

 

 

 

 

Proofs in Mathematics, by Alexander Bogomolny.

    This has a collection of proofs annotated to make them more interesting. Look at the proof techniques, rather than the contents of the theorems.

 

 

 

 

 

Understanding Mathematics, by Peter Alfeld.

    This has a useful introduction, especially for students who have math anxiety (or phobia). In his first deomonstration of "An Example of Logical Construction," he illustrates how to build on simpler mathematical concepts.

 

 

 

 

 

 

 

In addition, my Mathematical Programming Glossary contains many terms in graph theory and other areas discrete mathematics (and of computer science).

    Here are some example entries: