Notes

• Graphs, Euler Circuits, Valence
• Hamiltonian Circuits, Complete Graphs
• Traveling Salesman Problem
• Minimum Cost Spanning Trees
• Cut Property for MST’s and Shortest-Paths Algorithms
• Directed Graphs, Critical Paths
• Priority Lists, Scheduling, Independent Tasks
• Bin-packing, Vertex-Coloring
• Linear Programming, Mixture Problems
• Transportation Problems, Tableaux
• Voting Systems, Majority Rules
• Voting with more than 3 candidates
• Manipulability
• Error-Correcting, Identification Numbers
• Binary Codes, Parity Check
• Data Compression
• Cryptography