{"id":"https://openalex.org/W4396600736","doi":"https://doi.org/10.1016/j.tcs.2026.116138","title":"Reachability in temporal graphs under perturbation","display_name":"Reachability in temporal graphs under perturbation","publication_year":2026,"publication_date":"2026-06-29","ids":{"openalex":"https://openalex.org/W4396600736","doi":"https://doi.org/10.1016/j.tcs.2026.116138"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2026.116138","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.116138","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2026.116138","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014039487","display_name":"Jessica Enright","orcid":"https://orcid.org/0000-0002-0266-3292"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jessica Enright","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-0266-3292","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092160873","display_name":"Laura Larios-Jones","orcid":"https://orcid.org/0000-0003-3322-0176"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laura Larios-Jones","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3322-0176","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088807601","display_name":"Kitty Meeks","orcid":"https://orcid.org/0000-0001-5299-3073"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kitty Meeks","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5299-3073","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5014747179","display_name":"William Pettersson","orcid":"https://orcid.org/0000-0003-0040-2088"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"William Pettersson","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0040-2088","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":{"value":2600,"currency":"USD","value_usd":2600},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00188477,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1083","issue":null,"first_page":"116138","last_page":"116138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/reachability","display_name":"Reachability","score":0.9295011758804321},{"id":"https://openalex.org/keywords/perturbation","display_name":"Perturbation (astronomy)","score":0.44396060705184937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40923231840133667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3931019604206085},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.2770693898200989},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2338539958000183},{"id":"https://openalex.org/keywords/astronomy","display_name":"Astronomy","score":0.0697077214717865}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9295011758804321},{"id":"https://openalex.org/C177918212","wikidata":"https://www.wikidata.org/wiki/Q803623","display_name":"Perturbation (astronomy)","level":2,"score":0.44396060705184937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40923231840133667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3931019604206085},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.2770693898200989},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2338539958000183},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0697077214717865}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/j.tcs.2026.116138","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.116138","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2404.19479","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2404.19479","pdf_url":"https://arxiv.org/pdf/2404.19479","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:eprints.gla.ac.uk:389464","is_oa":true,"landing_page_url":"https://eprints.gla.ac.uk/view/author/28436.html>","pdf_url":"https://eprints.gla.ac.uk/389464/2/389464.pdf","source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Articles"},{"id":"doi:10.48550/arxiv.2404.19479","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2404.19479","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.1016/j.tcs.2026.116138","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.116138","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7066155747","display_name":"KidneyAlgo: New Algorithms for UK and International Kidney Exchange","funder_award_id":"EP/X013618/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7222129398","display_name":"Multilayer Algorithmics to Leverage Graph Structure (MultilayerALGS)","funder_award_id":"EP/T004878/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2156446763","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W4321471459","https://openalex.org/W2889071233"],"abstract_inverted_index":{"Reachability":[0],"and":[1,17,25,84],"other":[2],"path-based":[3],"measures":[4],"on":[5],"temporal":[6,29,82,144],"graphs":[7,30],"can":[8,97],"be":[9],"used":[10],"to":[11,23,36,43],"understand":[12],"spread":[13],"of":[14,64,88,93,142],"infection,":[15],"information,":[16],"people":[18],"in":[19,27,59,109,128],"modelled":[20],"systems.":[21],"Due":[22],"delays":[24],"errors":[26],"reporting,":[28],"derived":[31],"from":[32],"data":[33],"are":[34],"unlikely":[35],"perfectly":[37],"reflect":[38,52],"reality,":[39],"especially":[40],"with":[41,135],"respect":[42],"the":[44,86,90,140],"precise":[45],"times":[46],"at":[47],"which":[48,60,124],"edges":[49],"appear.":[50],"To":[51],"this":[53,78,105,126,134],"uncertainty,":[54],"we":[55,80],"consider":[56,85],"a":[57],"model":[58],"some":[61,75,136],"number":[62,92],"$\u03b6$":[63,116],"edge":[65],"appearances":[66],"may":[67],"have":[68],"their":[69],"timestamps":[70],"perturbed":[71],"by":[72],"$\\pm\u03b4$":[73],"for":[74],"$\u03b4$.":[76],"Within":[77],"model,":[79],"investigate":[81],"reachability":[83],"problem":[87,106,127],"determining":[89],"maximum":[91],"vertices":[94],"any":[95],"vertex":[96],"reach":[98],"under":[99,147],"these":[100],"perturbations.":[101],"We":[102,120,132],"show":[103],"that":[104],"is":[107,112,117],"intractable":[108],"general":[110],"but":[111],"efficiently":[113],"solvable":[114],"when":[115],"sufficiently":[118],"large.":[119],"also":[121],"give":[122],"algorithms":[123],"solve":[125],"several":[129],"restricted":[130],"settings.":[131],"complement":[133],"contrasting":[137],"results":[138],"concerning":[139],"complexity":[141],"related":[143],"eccentricity":[145],"problems":[146],"perturbation.":[148]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}