The quantum approximate optimization algorithm (QAOA) holds promise for combinatorial optimization but is constrained by limited qubits. While divide-and-conquer frameworks like QAOA 2 address ...

Graph partitioning and bisection represent fundamental questions in combinatorial optimisation, concerned with dividing the vertices of a graph into disjoint subsets while balancing size constraints ...

Protein complexes play a crucial role in cellular biological processes. Identifying these complexes is essential for understanding cellular functions and biological mechanisms. Graph clustering ...

Abstract: This work introduces FPGA-Par, an efficient graph partitioning algorithm for multi-FPGA systems. FPGA-Par utilizes an iterative balanced partitioning and supernodes transferring algorithm ...

Document-level Event Factuality Identification (DEFI) has always been the focus of Information Extraction and Information Credibility. This paper studies a novel task named Evidential Document-level ...

In the field of multi-objective evolutionary optimization, prior studies have largely concentrated on the scalability of objective functions, with relatively less emphasis on the scalability of ...

This test was disabled because it is failing in CI. See recent examples and the most recent trunk workflow logs. Over the past 6 hours, it has been determined flaky in 25 workflow(s) with 50 failures ...

Abstract: An important application of graph partitioning is data clustering using a graph model--- the pairwise similarities between all data objects form a weighted graph adjacency matrix that ...