15 citations · 15 across the 2 of their papers we have counts for
2 papers
cs.AI2022
Learning heuristics for A*
Danilo Numeroso, Davide Bacciu, Petar Veličković
Path finding in graphs is one of the most studied classes of problems in computer science. In this context, search algorithms are often extended with heuristics for a more efficien…
cs.LG2022★ 15 cited
Message passing all the way up
Petar Veličković
The message passing framework is the foundation of the immense success enjoyed by graph neural networks (GNNs) in recent years. In spite of its elegance, there exist many problems…