In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most of distributed and parallel graph algorithms in the MPC model are designed for static ...

Dijkstra's algorithm has long been the quickest way of finding the shortest possible paths in a network, but researchers have ...

CATALOG DESCRIPTION: Design and analysis of advanced algorithms: graph algorithms; maximal network flows; min-cost flow algorithms; convex cost flows. REQUIRED TEXT ...

If G is a graph and n a positive integer, then the generalized Sierpiński graph S G n is a fractal-like graph that uses G as a building block. The construction of S G n generalizes the classical ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...