Probabilistic Combinatorial Optimization on Graphs
 |
|
Описание:
This comprehensive survey requires only some mathematical understanding and knowledge about complexity and approximation theory and covers some of the most paradigmatic combinatorial problems on graphs, such as the maximum-independent set, minimum-vertex covering, longest path, and minimum coloring.Похожие книги
 | Threshold Graphs and Related Topics Автор: Mahadev N.V.R.,Peled U.N. Год: 1995 |
| Threshold Graphs and Related Topics, Volume 56 (Annals of Discrete Mathematics) Автор: N.V.R. Mahadev, U.N. Peled Год: 1995 |
 | The Grobner Annihilator Graph of a Ring Автор: Trevor McGuire Год: 2010 |
 | Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs Автор: Ahmed Shamsul Arefin Год: 2010 |
 | Randomized techniques in combinatorial algorithms Автор: Zito M.A.A. Год: 1999 |
| Dynamic Graph Algorithms Автор: Eppstein D., Galil Z., Italiano F. |