Beschreibung
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.
Autorenporträt
Sándor Szabó has born and grew up in Hungary. He graduated from the Eötvös University of Budapest. Worked for the Technical University of Budapest and held several visting positions. Recently he is at the University of Pécs. His main mathematical interest lies in the applications of discrete mathematics.
Herstellerkennzeichnung:
OmniScriptum SRL
Str. Armeneasca 28/1, office 1
2012 Chisinau
MD
E-Mail: info@omniscriptum.com
