-
Stochastic Block Model
The stochastic block model is a statistical problem where the goal is to recover a community structure from a graph. The model is defined by a graph G with vertex set [n] =... -
Feedback Vertex Set Problem
The dataset used in the paper is a set of undirected graphs, specifically Erdoøs-Renyi random graphs and regular random graphs. -
Hyperbolic Minesweeper
Hyperbolic Minesweeper is a puzzle game played on a tessellation of the hyperbolic plane. -
Wolfram Database of Simple Graphs
Wolfram Database of Simple Graphs -
Synthetic Networks
The dataset used in the paper is a synthetic network generated under four network models: SBM, DCBM, RDPG, and latent space model. -
Minimum Spanning Tree
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. -
Graph Theory for Metro Traffic Modelling
The dataset is used for modeling metro transportation networks using graph theory. It contains the London underground network graph, passenger flow data, and population density... -
Maximum Independent Set
The dataset is used to evaluate the performance of the proposed method.