Linked e-resources
Details
Table of Contents
Using Synthetic Networks for Parameter Tuning in Community Detection
Efficiency of Transformations of Proximity Measures for Graph Clustering
Almost Exact Recovery in Label Spreading
Strongly n-e.c. Graphs and Independent Distinguishing Labellings
The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs
Estimating the Parameters of the Waxman Random Graph
Understanding the Effectiveness of Data Reduction in Public Transportation Networks
A Spatial Small-World Graph Arising from Activity-Based Reinforcement
SimpleHypergraphs.jl
Novel Software Framework for Modelling and Analysis of Hypergraphs.
Efficiency of Transformations of Proximity Measures for Graph Clustering
Almost Exact Recovery in Label Spreading
Strongly n-e.c. Graphs and Independent Distinguishing Labellings
The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs
Estimating the Parameters of the Waxman Random Graph
Understanding the Effectiveness of Data Reduction in Public Transportation Networks
A Spatial Small-World Graph Arising from Activity-Based Reinforcement
SimpleHypergraphs.jl
Novel Software Framework for Modelling and Analysis of Hypergraphs.