activity
20232026
most citedTheoretical Studies of the k-Strong Roman Domination Problem

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing cs.SIShow all

1 paper · 1 filter

cs.SI2026

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

Maryam Gholami Shiri, Ivana Krminac, Marko Djukanović +3

Benchmarking shortest-path algorithms is commonly based on aggregate performance over heterogeneous graph sets, which limits insight into how different search paradigms react to in…