Homophily principle,\ie {} nodes with the same labels or similar attributes are more likely to
be connected, has been commonly believed to be the main reason for the superiority of …

Train Timetable Rescheduling (TTR) is a crucial task in the daily operation of high-speed
railways to maintain punctuality and efficiency in the presence of unexpected disturbances …

In recent years, there has been a notable surge in research on machine learning techniques
for combinatorial optimization. It has been shown that learning-based methods outperform …

We introduce a quantum-inspired algorithm for graph coloring problems (GCPs) that utilizes
qudits in a product state, with each qudit representing a node in the graph and …

The graph coloring problem is an optimization problem involving the assignment of one of q
colors to each vertex of a graph such that no two adjacent vertices share the same color …

Graph neural networks (GNNs) have emerged as a powerful tool for solving combinatorial
optimization problems (COPs), exhibiting state-of-the-art performance in both graph …

While graph heterophily has been extensively studied in recent years, a fundamental
research question largely remains nascent: How and to what extent will graph heterophily …

The graph coloring problem functions as a fundamental and pivotal combinatorial
optimization task and has played an essential role in various domains such as wireless …

Abstract The Graph Coloring Using Bacterial Foraging Optimization (BFO) algorithm
efficiently addresses the graph coloring problem by ensuring adjacent nodes are assigned …

Abstract The Graph Coloring Using Bacterial Foraging Optimization (BFO) algorithm
efficiently addresses the graph coloring problem by ensuring adjacent nodes are assigned …