Understand the principles of efficient algorithms for dealing with large scale data sets and be able to select appropriate algorithms for specific problems. Understand and be able to apply the main ...

A well-founded tree T defined on the vertex set of a graph G is called normal if the endvertices of any edge of G are comparable in T. We study how normal trees can be used to describe the structure ...

Abstract: For spin systems on a tree, the reconstruction problem is to determine whether correlations persist between vertices deep inside the tree and the root. The problem has been studied in ...