Tootfinder

HyColor: An Efficient Heuristic Algorithm for Graph Coloring
Enqiang Zhu, Yu Zhang, Haopeng Sun, Ziqi Wei, Witold Pedrycz, Chanjuan Liu, Jin Xu
https://arxiv.org/abs/2506.07373

HyColor: An Efficient Heuristic Algorithm for Graph Coloring
The graph coloring problem (GCP) is a classic combinatorial optimization problem that aims to find the minimum number of colors assigned to vertices of a graph such that no two adjacent vertices receive the same color. GCP has been extensively studied by researchers from various fields, including mathematics, computer science, and biological science. Due to the NP-hard nature, many heuristic algorithms have been proposed to solve GCP. However, existing GCP algorithms focus on either small hard …

Properties and Expressivity of Linear Geometric Centralities
Paolo Boldi, Flavio Furia, Chiara Prezioso
https://arxiv.org/abs/2506.19670 https://

Properties and Expressivity of Linear Geometric Centralities
Centrality indices are used to rank the nodes of a graph by importance: this is a common need in many concrete situations (social networks, citation networks, web graphs, for instance) and it was discussed many times in sociology, psychology, mathematics and computer science, giving rise to a whole zoo of definitions of centrality. Although they differ widely in nature, many centrality measures are based on shortest-path distances: such centralities are often referred to as geometric. Geometric…