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

Quantum Computing Inc, a leader in bridging the power of classical and quantum computing, is introducing QGraph, which analyzes graphs (i.e., collections of vertices and edges) with QCI’s cloud-based ...

Quantum Computing Inc., a Leesburg, VA-based company focused on bridging classical and quantum computing, today announced a three-year cooperative research and development agreement with Los Alamos ...

Sue Mniszewski has been a research staff member at Los Alamos National Lab (LANL) for over forty years and in that time has watched several novel architectures come and go. While it’s but one of ...