Distributed algorithms for graph problems represent a vibrant area of study that addresses the challenges of decentralised computation across interconnected networks. By partitioning complex graph ...

Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into ...

At the core of many algorithmic methods for processing sequencing data is the basic primitive of finding a set of paths or walks in graphs of various nature. Under different formulations and objective ...

Abstract: We define a graph-based rate optimization problem and consider its computation, which provides a unified approach to the computation of various theoretical limits, including the (conditional ...

While their formula and approach have not cost them yet, it can turn out to be a problem in the future. If they want to maintain their edge deep into the season and into the playoffs, they may ...

In this inverse problem, researchers use data about a chemical contaminant’s spread through a city (purple area) with ...

Abstract: In the paper we present evaluation of the PCJ (Parallel Computations in Java) library for graph problems, namely for the first kernel in Graph500 benchmark. PCJ is a library for parallel ...

This pioneering book presents a study of the interrelationships among operator calculus, graph theory, and quantum probability ... for tackling important real world problems related, but not limited ...