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 ...

Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

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 ...

There's nothing like good old-fashioned cash inducements to get the creative juices flowing. Graph analytics software maker TigerGraph is dipping deeply into its bank account in a global search to ...