Invited lectures APS2 and Lalginar: Bogdán Zaválnij

Submitted by mjekovec on Thu, 05/29/2014 - 15:45

Bogdán Zaválnij, University of Pécs, Hungary will have an invited lecture at Algorithms and data structures 2 course on Thursday, 29 May 2014 at 7:30 in Lecture room 2, Tržaška 25. He will talk about the Monte Carlo and Las Vegas methods and about the parallel programming using MPI. He will also demonstrate the execution of algorithms on one of their super computers.

Link to the APS2 slides.

On Friday, 30 May 2014 at 11h in LALG, Tržaška 25, he will have a LALGinar presentation on the following topic:

Lalginar talk abstract: Different Coloring Methods — theoretical and experimental approach:

Edge free, or legal coloring proved to be most useful in practical
NP-hard discrete optimization problem solving like searching the
maximum clique in a simple graph. As the legal coloring itself an
NP-hard problem, we usually use some approximate coloring scheme as
for example the DSatur method from Daniel Brelaz. Then we use the
given coloring for preconditioning and pruning in our algorithms.

The usefulness of the legal coloring opens up the possibility to seek
for alternative coloring methods, which would serve the same role of
pruning and preconditioning, but hopefully in a more effective way.

In my talk I would like to present our recent research results on
different edge coloring and node coloring schemes. These proved not
only give better upper bounds as the legal coloring, but could be used
for solving other discrete optimization problems as the problem of
search for the maximum transitive tournament.

Few words about the lecturer:

I started teaching at the University of Pecs in 2006, where I give
lectures and seminars in Parallel Programming, Operating Systems,
Programming methods, Algorithms and Data Structures. My field of
research is practical solutions for NP-hard discrete optimization
problems, on which I work together with professor Sandor Szabo, with
whom we have published several papers in this topic. For the purpose
of testing our algorithms we use the supercomputers in Pecs and
Finland. I also have recently finished a monograph on parallel
programming with MPI with detailed examples.

Link to the LALGinar slides.