Advanced Algorithms

A Treap is a data structure that mantains a dynamic set of ordered keys and allows binary searches among the keys. In a treap, after a sequence of insertion and deletions, the height of the tree is…

The Minimum Cut problem A cut $(S,T)$ in an undirected graph $G=(V,E)$ is a partition of the vertices $V$ into two non-empty, disjoint sets $S\cup T=V$. The cutset of a cut consists of the edges…

A self-organizing list is a list that reorders its elements based on some self-organizing heuristic to improve average access time . The aim of a self-organizing list is to improve efficiency of…