Abstract: We give the first truly subquadratic time algorithm, with ${O^{\ast}}\left( {{n^{2 - 1/18}}} \right)$ running time, for computing the diameter of an n-vertex unit-disk graph, resolving a ...
Abstract: Recent advances in graph neural network (GNN) architectures and increased computation power have revolutionized the field of combinatorial optimization (CO). Among the proposed models for CO ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results