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.
Ссылка удалена правообладателем ---- The book removed at the request of the copyright holder.
