{"id":"https://openalex.org/W7165140624","doi":"https://doi.org/10.48550/arxiv.2606.18267","title":"Graph Instance Landscapes: When Structural Similarity Does (Not) Reflect Shortest-Path Performance","display_name":"Graph Instance Landscapes: When Structural Similarity Does (Not) Reflect Shortest-Path Performance","publication_year":2026,"publication_date":"2026-06-01","ids":{"openalex":"https://openalex.org/W7165140624","doi":"https://doi.org/10.48550/arxiv.2606.18267"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.18267","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18267","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.18267","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133839634","display_name":"Maryam Gholami Shiri","orcid":"https://orcid.org/0009-0007-0635-2778"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shiri, Maryam Gholami","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138945909","display_name":"Ivana Krminac","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krminac, Ivana","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111191723","display_name":"Marko Djukanovi\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Djukanovi\u0107, Marko","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064609702","display_name":"Sa\u0161o D\u017eeroski","orcid":"https://orcid.org/0000-0003-2363-712X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D\u017eeroski, Sa\u0161o","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050579174","display_name":"Eva Tuba","orcid":"https://orcid.org/0000-0003-4866-9048"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tuba, Eva","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5082115266","display_name":"Tome Eftimov","orcid":"https://orcid.org/0000-0001-7330-1902"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eftimov, Tome","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.28600001335144043,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.28600001335144043,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12644","display_name":"Wildlife-Road Interactions and Conservation","score":0.08529999852180481,"subfield":{"id":"https://openalex.org/subfields/2303","display_name":"Ecology"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.08460000157356262,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.7829999923706055},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7026000022888184},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5580000281333923},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5051000118255615},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4991999864578247},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4864000082015991},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4343000054359436},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.3407999873161316}],"concepts":[{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.7829999923706055},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7026000022888184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.576200008392334},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5580000281333923},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5051000118255615},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4991999864578247},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4864000082015991},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4810999929904938},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4343000054359436},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.38679999113082886},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3424000144004822},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.3407999873161316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3361999988555908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3172000050544739},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.28529998660087585},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C177774035","wikidata":"https://www.wikidata.org/wiki/Q1246948","display_name":"Granularity","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2605000138282776},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C105611402","wikidata":"https://www.wikidata.org/wiki/Q2976589","display_name":"Spectral clustering","level":3,"score":0.2558000087738037},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.18267","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18267","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.18267","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18267","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5319094061851501}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Benchmarking":[0],"shortest-path":[1,70,169],"algorithms":[2],"is":[3,92],"commonly":[4],"based":[5],"on":[6],"aggregate":[7],"performance":[8,125],"over":[9],"heterogeneous":[10],"graph":[11,31],"sets,":[12],"which":[13],"limits":[14,160],"insight":[15],"into":[16,36,45],"how":[17],"different":[18,145],"search":[19,75,79,84],"paradigms":[20],"react":[21],"to":[22],"instance":[23],"structure.":[24,49],"We":[25,66],"adopt":[26],"an":[27],"instance-landscape":[28],"view":[29],"of":[30,47,161,168],"benchmarking":[32,167],"by":[33],"embedding":[34],"graphs":[35],"a":[37],"low-cost":[38],"structural":[39,114,162],"feature":[40],"space":[41],"and":[42,62,86,98,158],"clustering":[43],"them":[44],"regions":[46,105],"similar":[48],"Three":[50],"benchmark":[51,146],"suites":[52],"are":[53,101,130],"studied:":[54],"weighted":[55],"Erd\u0151s--R\u00e9nyi":[56],"graphs,":[57,61],"random":[58],"geometric":[59],"(wireless)":[60],"real-world":[63],"road":[64],"networks.":[65],"evaluate":[67],"four":[68],"representative":[69],"solvers":[71],"spanning":[72],"uninformed":[73],"exact":[74,78,83],"(Dijkstra),":[76],"bidirectional":[77],"(bidirectional":[80],"Dijkstra),":[81],"heuristic-guided":[82],"(A$^{*}$),":[85],"deque-based":[87],"strategies":[88],"(DEQ).":[89],"Clustering":[90],"robustness":[91],"analyzed":[93],"under":[94],"multiple":[95],"feature-selection":[96],"schemes,":[97],"runtime":[99,128],"distributions":[100],"compared":[102],"across":[103],"landscape":[104,137],"using":[106],"non-parametric":[107],"tests.":[108],"While":[109],"generator":[110],"parameters":[111],"induce":[112],"stable":[113],"regions,":[115],"we":[116],"find":[117],"that":[118,144],"feature-space":[119],"similarity":[120],"does":[121],"not":[122],"necessarily":[123],"imply":[124],"similarity:":[126],"significant":[127],"shifts":[129],"frequently":[131],"observed":[132],"even":[133],"within":[134],"the":[135,156,159,165],"same":[136],"region.":[138],"A":[139],"merged-suite":[140],"analysis":[141],"further":[142],"shows":[143],"families":[147],"occupy":[148],"largely":[149],"disjoint":[150],"regions.":[151],"These":[152],"results":[153],"highlight":[154],"both":[155],"potential":[157],"landscapes":[163],"for":[164],"structure-aware":[166],"algorithms.":[170]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-19T00:00:00"}