Probabilistic combinatorial optimization on graphs /

This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the min...

Full description

Bibliographic Details

Main Author:	Murat, Cecile
Other Authors:	Paschos, Vangelis Th
Format:	eBook
Language:	English
Published:	London ; Newport Beach, CA : ISTE, 2006.
Subjects:	Combinatorial probabilities. Combinatorial optimization. Random graphs.
Online Access:	Connect to the full text of this electronic book