D.4: Graph Theory

Revision as of 00:40, 7 November 2011 by Poul.murtha (Talk | contribs)

Oregon Department of Education knowledge and skills for Graph Theory

D.4 Graph Theory: Understand how graphs of vertices joined by edges can model relationships and be used to solve a wide variety of problems.

D.4.1 Use graphs to model and solve problems such as shortest paths, vertex coloring, critical paths, routing, and scheduling problems.

D.4.2 Convert from a graph to an adjacency matrix and vice versa.

D.4.3 Use directed graphs, spanning trees, rooted trees, binary trees, or decision trees to solve problems.

D.4.4 Demonstrate understanding of algorithms such as depth-first and breadth-first walk of a tree or maximal matching.

D.4.5 Use matching or bin-packing techniques to solve optimization and other problems.

D.4.6 Compare and contrast different graph algorithms in terms of efficiency and types of problems that can be solved.

[[General information page from Stephen Locke at Florida Atlantic University:[1]]]