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

The problem considered in this paper is that of partitioning a link-weighted graph G into two parts, each of which is constrained in size by the (given) maximum number of vertices that the part can ...

Victor Lee is director of product management at TigerGraph. Graph databases excel at answering complex questions about relationships in large data sets. But they hit a wall—in terms of both ...