4 datasets found

Hyperbolic Minesweeper is a puzzle game played on a tessellation of the hyperbolic plane.

The dataset used in the paper is a synthetic network generated under four network models: SBM, DCBM, RDPG, and latent space model.

The dataset used in the paper is the Minimum Spanning Tree problem, a combinatorial optimization problem where the goal is to find a minimum spanning tree of a graph.

The dataset is used to evaluate the performance of the proposed method.