{"id":"https://openalex.org/W4407932667","doi":"https://doi.org/10.1007/s00453-025-01301-3","title":"Counting Temporal Paths","display_name":"Counting Temporal Paths","publication_year":2025,"publication_date":"2025-02-25","ids":{"openalex":"https://openalex.org/W4407932667","doi":"https://doi.org/10.1007/s00453-025-01301-3","pmid":"https://pubmed.ncbi.nlm.nih.gov/40352583"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-025-01301-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01301-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01301-3.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01301-3.pdf","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":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jessica Enright","raw_affiliation_strings":["School of Computing Science, University of Glasgow, Glasgow, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, University of Glasgow, Glasgow, UK","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088807601","display_name":"Kitty Meeks","orcid":"https://orcid.org/0000-0001-5299-3073"},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kitty Meeks","raw_affiliation_strings":["School of Computing Science, University of Glasgow, Glasgow, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, University of Glasgow, Glasgow, UK","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102795134","display_name":"Hendrik Molter","orcid":"https://orcid.org/0000-0002-4590-798X"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Hendrik Molter","raw_affiliation_strings":["Department of Computer Science and Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Be'er Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Be'er Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102795134"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.04532614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"87","issue":"5","first_page":"736","last_page":"782"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9902999997138977,"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"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.8944934010505676},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.694278359413147},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6388366222381592},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.5614804029464722},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4965119957923889},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4679108262062073},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46564990282058716},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4473719000816345},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44309771060943604},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43776601552963257},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41050171852111816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3975304365158081},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38229233026504517},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3565978407859802},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3449917137622833},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.31973424553871155}],"concepts":[{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.8944934010505676},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.694278359413147},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6388366222381592},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.5614804029464722},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4965119957923889},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4679108262062073},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46564990282058716},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4473719000816345},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44309771060943604},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43776601552963257},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41050171852111816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3975304365158081},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38229233026504517},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3565978407859802},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3449917137622833},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.31973424553871155},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-025-01301-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01301-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01301-3.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmid:40352583","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/40352583","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":null},{"id":"pmh:oai:eprints.gla.ac.uk:348161","is_oa":true,"landing_page_url":"https://eprints.gla.ac.uk/view/author/28436.html>","pdf_url":null,"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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:pubmedcentral.nih.gov:12062201","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/12062201","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"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":"Algorithmica","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1007/s00453-025-01301-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01301-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01301-3.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4813334627","display_name":null,"funder_award_id":"949707","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European 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"},{"id":"https://openalex.org/G8400095090","display_name":null,"funder_award_id":"1456/18","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320323051","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4407932667.pdf"},"referenced_works_count":68,"referenced_works":["https://openalex.org/W1537447662","https://openalex.org/W1565660154","https://openalex.org/W1619010075","https://openalex.org/W1874858905","https://openalex.org/W1937334562","https://openalex.org/W1971937094","https://openalex.org/W1978452004","https://openalex.org/W1980074516","https://openalex.org/W1984196269","https://openalex.org/W1993342383","https://openalex.org/W2012724202","https://openalex.org/W2054260295","https://openalex.org/W2102039892","https://openalex.org/W2109716789","https://openalex.org/W2112624678","https://openalex.org/W2115826669","https://openalex.org/W2116087731","https://openalex.org/W2137874581","https://openalex.org/W2139322472","https://openalex.org/W2151677066","https://openalex.org/W2171707538","https://openalex.org/W2327974553","https://openalex.org/W2461566632","https://openalex.org/W2498592833","https://openalex.org/W2522462178","https://openalex.org/W2735320078","https://openalex.org/W2835349798","https://openalex.org/W2884007467","https://openalex.org/W2898312999","https://openalex.org/W2903339430","https://openalex.org/W2914414140","https://openalex.org/W2949263370","https://openalex.org/W2950969150","https://openalex.org/W2954025126","https://openalex.org/W2963235090","https://openalex.org/W2964196611","https://openalex.org/W2964299995","https://openalex.org/W2968468046","https://openalex.org/W2970341242","https://openalex.org/W3015837792","https://openalex.org/W3034876319","https://openalex.org/W3044233549","https://openalex.org/W3080676684","https://openalex.org/W3091847779","https://openalex.org/W3096671981","https://openalex.org/W3101862638","https://openalex.org/W3101906233","https://openalex.org/W3103944330","https://openalex.org/W3108547121","https://openalex.org/W3109089857","https://openalex.org/W3111890340","https://openalex.org/W3129250346","https://openalex.org/W3135496652","https://openalex.org/W3155920611","https://openalex.org/W3157160562","https://openalex.org/W3162196475","https://openalex.org/W3164090850","https://openalex.org/W3164856871","https://openalex.org/W3166547661","https://openalex.org/W3199947862","https://openalex.org/W3208823229","https://openalex.org/W3216381664","https://openalex.org/W4235239597","https://openalex.org/W4237347223","https://openalex.org/W4253175698","https://openalex.org/W4385767438","https://openalex.org/W4398147840","https://openalex.org/W4400451533"],"related_works":["https://openalex.org/W3013741436","https://openalex.org/W2363632570","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W4387185483","https://openalex.org/W616034966","https://openalex.org/W2018146256","https://openalex.org/W2022506245","https://openalex.org/W4399175858"],"abstract_inverted_index":{"This":[0],"work":[1],"investigates":[2],"the":[3,57,98,112,129,142,153,162,167,181],"parameterised":[4,143],"complexity":[5,146],"of":[6,12,26,43,83,100,109,114,132,141,147,166],"counting":[7,13,92,101,115],"temporal":[8,14,20,53,69,89,103,119],"paths.":[9],"The":[10,23],"problem":[11,93,99,154],"paths":[15,40,70,104],"is":[16,30,123,174],"mainly":[17],"motivated":[18],"by":[19,128],"betweenness":[21,24,49],"computation.":[22],"centrality":[25,33,50],"a":[27,52,106,138],"vertex":[28,164],"<i>v</i>":[29],"an":[31,159],"important":[32],"measure":[34],"that":[35,71,152,172],"quantifies":[36],"how":[37],"many":[38,130],"optimal":[39,73],"between":[41,105],"pairs":[42],"other":[44],"vertices":[45],"visit":[46],"<i>v</i>.":[47],"Computing":[48],"in":[51,55,125,178],"graph,":[54,170],"which":[56],"edge":[58],"set":[59],"may":[60],"change":[61],"over":[62],"discrete":[63],"timesteps,":[64],"requires":[65],"us":[66],"to":[67,76,95,176],"count":[68],"are":[72],"with":[74],"respect":[75],"some":[77],"criterion.":[78],"For":[79],"several":[80,186],"natural":[81],"notions":[82],"optimality,":[84],"including":[85],"<i>foremost</i>":[86],"or":[87],"<i>fastest</i>":[88],"paths,":[90,120],"this":[91,133],"reduces":[94],"#Temporal":[96,121,148],"Path,":[97],"<i>all</i>":[102],"fixed":[107],"pair":[108],"vertices;":[110],"like":[111],"problems":[113],"foremost":[116],"and":[117,144,171,188],"fastest":[118],"Path":[122],"#P-hard":[124],"general.":[126,179],"Motivated":[127],"applications":[131],"intractable":[134],"problem,":[135],"we":[136,184],"initiate":[137],"systematic":[139],"study":[140],"approximation":[145],"Path.":[149],"We":[150],"show":[151],"presumably":[155],"does":[156],"not":[157],"admit":[158],"FPT-algorithm":[160],"for":[161,191],"feedback":[163],"number":[165],"static":[168],"underlying":[169],"it":[173],"hard":[175],"approximate":[177,189],"On":[180],"positive":[182],"side,":[183],"prove":[185],"exact":[187],"FPT-algorithms":[190],"special":[192],"cases.":[193]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}