You are here
Data science and Complex networks szeminárium
Félév:
2017/18 I. félév
Helyszín:
Árpád tér 2. II. em. 220. sz.
Dátum:
2017-10-26
Időpont:
15:00-16:00
Előadó:
Sándor Szabó (University of Pécs)
Cím:
Estimating clique number in high performance computing environment
Absztrakt:
Suppose A is an algorithm to locate an upper estimate for the clique number of a given graph G. Using algorithm A one can construct a new A' algorithm that provides an improved estimate of the size of the maximum cliques in G. The fact that such algorithm A' exists does not come as a surprise to us. The point is that the construction is practical and the new algorithm A' well suited for various high performance computing environments. We carried out a large scale numerical experiment to test our proposal.