Graphs and Optimization
- 406 Downloads
The matching problem is an important combinatorial problem defined on a graph. Graphs provide very often a pictorial representation of the mathematical structure underlying combinatorial optimization problems. On the other hand, graph theory is by itself rich of elegant results that can give us useful insights on many combinatorial and physical problems. For these reasons, we present here a very short introduction to the basic definitions and results of graph theory. We will refer mostly to the standard textbook of Diestel .
KeywordsLinear Optimization Problem Simplex Tableau Hungarian Algorithm Eulerian Subgraph Computational Complexity Classes
- 3.R. Diestel, Graph Theory, Springer Graduate Texts in Mathematics (GTM) (Springer,Heidelberg, 2012)Google Scholar
- 6.D. Jungnickel, T. Schade, Graphs, Networks and Algorithms (Springer, Berlin, 2005)Google Scholar
- 7.V. Klee, G.J. Minty, How good is the simplex algorithm. Technical report, DTIC Document (1970)Google Scholar
- 9.L. Lovász, D. Plummer, Matching Theory. AMS Chelsea Publishing Series (AMS, Providence, 2009)Google Scholar