Graph Instance Landscapes: When Structural Similarity Does (Not) Reflect Shortest-Path Performance

Read full text
Authors: Anonymous
Cited by: 0

Abstract

Repository Structure The repository is organized into the following directories: DATA/ Contains the graph instance datasets:- `random_instances_results_4_algs_single.csv`- `geometric_instances_results_4_algs_single.csv`- `real_instances_results_4_algs_single.csv`- `all_instances_results_4_algs_single.csv` --- GraphInstance_Analysis_Results/ Contains all experimental outputs and visualizations. ### feature_selection/Feature selection results (low-variance and uncorrelated features) and summary tables. ### random_instances_results_4_algs_single/### geometric_instances_results_4_algs_single/### real_instances_results_4_algs_single/Per-dataset clustering results, including:- Elbow and silhouette plots - PCA, t-SNE, and MDS projections - Cluster coverage heatmaps ### combined_random_geometric_real/Results for clustering on the merged benchmark (random + geometric + real), including silhouette plots and mixed coverage heatmaps. ### cluster_similarity_analysis/Cluster similarity comparisons between original, low-variance, and uncorrelated feature spaces, with cosine similarity heatmaps. ### stat_analysis/Statistical analysis results for random and geometric datasets, including:- KS and Anderson–Darling test results - KDE plots of algorithm performance distributions

Fields of Study & Subjects

Graph Theory and Algorithms Complexity and Algorithms in Graphs Complex Network Analysis Techniques

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
30 January 2026