Our research is focused on graph algorithms, from both a theoretical perspective ... We also study related algorithmic topics, such as combinatorial optimization, enumeration algorithms, string ...

To address optimization issues on such networks, it is necessary to understand the network’s logical structure and develop high-speed and high-precision algorithms. Further, these algorithms must be ...

Coordinating complicated interactive systems, whether it's the different modes of transportation in a city or the various ...

It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential ...

Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many algorithms always seem to work efficiently. But in theory, there is no guarantee.

Puneet Gupta's research highlights the immense potential of greedy algorithms in addressing timing closure challenges.

The research team (NEAL) at the University of South China has proposed an innovative radiation-shielding optimization method ...

The research team (NEAL) from the University of South China has made significant progress in nuclear reactor ...

To address this, the team coupled D-MPNNs with genetic algorithms, enabling flexible and library-free molecular optimization ... quantification with graph neural networks for efficient molecular ...