There is a large number of problems from various walks of real life and mathematics itself that can be expressed in terms of the existence of a clique in a suitably constructed finite simple graph. This text is devoted to describe and illustrate algorithms that are parts of typical clique search algorithms. In order to develop a firm grip on these procedures and to have a clear understanding of the underlying concepts one has to be able to handle at least small size of examples confidently. The text addresses this issue as well.
|Number of Pages||368|
|Book Type||Computing & Information Technology|
|Country of Manufacture||India|
|Product Brand||LAP LAMBERT Academic Publishing|
|In The Box||1 Piece(Paperback)|
|Product First Available On ClickOnCare.com||2015-06-26 00:00:00|