Graphs, Networks, and Algorithms

Basic concepts. Trees, cutsets, and circuits. Eulerian and hamiltonian graphs. Graphs and vector spaces. Directed graphs. Matrices of a graph. Planarity and duality. Connectivity and matching. Covering and coloring. Matroids. Graphs and networks. Resistance n-port networks. Network functions and network sensitivity. Algorithmic analysis. Algorithmic optimization.