Graph connectivities and submodular functions are two widely applied and fast developing fields of combinatorial optimization. This book not only includes the most recent results, but also highlights several surprising connections between diverse topics of combinatorial optimization. It offers a unified treatment of developments in the concepts and algorithmic methods of the area, starting from basic results on graphs, matroids and polyhedral combinatorics,
through the advanced topics of connectivity issues of graphs and networks, to the abstract theory and applications of submodular optimization. Difficult theorems and algorithms are made accessible to
graduate students in mathematics, computer science, operations research, informatics and communication.