Found 6 relevant results in 2.24s where lecturer="Maurice Cochand"
No description available.
Discrete Mathematics
Diskrete Mathematik
Introduction to foundations of discrete mathematics: combinatorics (elementary counting), graph theory, algebra, and applications thereof.
Introduction to polyhedral combinatorics: Minimal spanning trees, branchings, bipartite matching, matroid polytope, intersection of 2 matroids, cutting planes and Lagrangean relaxation with application to the TSP.
Pseudorandomness.
In a first part we present both constructions and applications of expander graphs. These are graphs with few edges, but nevertheless very well connected. Said differently, all subsets of nodes have "many" neighbours, a property that is related to the eigenvalues of the adjacency matrix of the graph.
In a first part we present both constructions and applications of expander graphs. These are graphs with few edges, but nevertheless very well connected. Said differently, all subsets of nodes have "many" neighbours, a property that is related to the eigenvalues of the adjacency matrix of the graph.