arXiv:2606.18267v1 Announce Type: cross Abstract: Benchmarking shortest-path algorithms is commonly based on aggregate performance over heterogeneous graph sets, which limits insight into how different search paradigms react to instance structure. We adopt an instance-landscape view of graph benchmarking by embedding graphs into a low-cost structural feature space and clustering them into regions of similar structure. Three benchmark suites are studied: weighted Erd\H{o}s--R\'enyi graphs, random geometric (wireless) graphs, and real-world road networks. We evaluate four representative shortest
Source: arXiv cs.LG — read the full report at the original publisher.