{"id":"https://openalex.org/W2244843312","doi":"https://doi.org/10.14778/2732939.2732945","title":"Path problems in temporal graphs","display_name":"Path problems in temporal graphs","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2244843312","doi":"https://doi.org/10.14778/2732939.2732945","mag":"2244843312"},"language":"en","primary_location":{"id":"doi:10.14778/2732939.2732945","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2732939.2732945","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038471865","display_name":"Huanhuan Wu","orcid":"https://orcid.org/0000-0002-9423-5614"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Huanhuan Wu","raw_affiliation_strings":["The Chinese University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016082884","display_name":"James Cheng","orcid":"https://orcid.org/0000-0001-6313-6288"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"James Cheng","raw_affiliation_strings":["The Chinese University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090828085","display_name":"Silu Huang","orcid":"https://orcid.org/0000-0002-5291-0167"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Silu Huang","raw_affiliation_strings":["The Chinese University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074491217","display_name":"Yiping Ke","orcid":"https://orcid.org/0000-0001-9473-3202"},"institutions":[{"id":"https://openalex.org/I3004594783","display_name":"Institute of High Performance Computing","ror":"https://ror.org/02n0ejh50","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I3004594783","https://openalex.org/I91275662"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Yiping Ke","raw_affiliation_strings":["Institute of High Performance Computing, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of High Performance Computing, Singapore","institution_ids":["https://openalex.org/I3004594783"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020039212","display_name":"Yi Lu","orcid":"https://orcid.org/0000-0001-6066-9249"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yi Lu","raw_affiliation_strings":["The Chinese University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100704964","display_name":"Yanyan Xu","orcid":"https://orcid.org/0000-0001-7174-6588"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yanyan Xu","raw_affiliation_strings":["The Chinese University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":14.9749,"has_fulltext":false,"cited_by_count":282,"citation_normalized_percentile":{"value":0.99158108,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"7","issue":"9","first_page":"721","last_page":"732"},"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.9998999834060669,"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.9998999834060669,"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/T11478","display_name":"Caching and Content Delivery","score":0.9970999956130981,"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7941961288452148},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6763705015182495},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6041873097419739},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5693132877349854},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.438631147146225},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4364681839942932},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4254278242588043},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.42426151037216187},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38327425718307495},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3543004095554352},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33343833684921265},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.24700504541397095},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13084283471107483}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7941961288452148},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6763705015182495},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6041873097419739},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5693132877349854},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.438631147146225},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4364681839942932},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4254278242588043},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.42426151037216187},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38327425718307495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3543004095554352},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33343833684921265},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.24700504541397095},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13084283471107483}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/2732939.2732945","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2732939.2732945","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1593360408","https://openalex.org/W1746637951","https://openalex.org/W1864844333","https://openalex.org/W1971864278","https://openalex.org/W1982385612","https://openalex.org/W1984196269","https://openalex.org/W1985718595","https://openalex.org/W1986909918","https://openalex.org/W2059763605","https://openalex.org/W2096304152","https://openalex.org/W2101092380","https://openalex.org/W2120063789","https://openalex.org/W2125349172","https://openalex.org/W2146456494","https://openalex.org/W2164641477","https://openalex.org/W2764587448","https://openalex.org/W2963681731","https://openalex.org/W3037066368","https://openalex.org/W3037819556","https://openalex.org/W3102945079","https://openalex.org/W3199947862","https://openalex.org/W6674965383","https://openalex.org/W6780631547","https://openalex.org/W6785790039"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2198982833","https://openalex.org/W2776102956","https://openalex.org/W2002764510","https://openalex.org/W2612665926","https://openalex.org/W4294360851","https://openalex.org/W2388410942","https://openalex.org/W2365712669"],"abstract_inverted_index":{"Shortest":[0],"path":[1,16,48,59,74],"is":[2,17,67],"a":[3,23,50,72,80],"fundamental":[4],"graph":[5],"problem":[6],"with":[7],"numerous":[8],"applications.":[9],"However,":[10],"the":[11,27,31,43,87],"concept":[12],"of":[13,33,45,57,71,86],"classic":[14,46],"shortest":[15,47,124],"insufficient":[18],"or":[19],"even":[20],"flawed":[21],"in":[22,49,79,126],"temporal":[24,28,51,61,65,81,88,104,114,120],"graph,":[25,52],"as":[26,69],"information":[29],"determines":[30],"order":[32],"activities":[34],"along":[35],"any":[36],"path.":[37],"In":[38],"this":[39],"paper,":[40],"we":[41],"show":[42,112],"shortcomings":[44],"and":[53,90,110],"study":[54],"various":[55],"concepts":[56],"\"shortest\"":[58,73,78],"for":[60,118],"graphs.":[62,129],"Computing":[63],"these":[64],"paths":[66,89,115,125],"challenging":[68],"subpaths":[70],"may":[75],"not":[76],"be":[77],"graph.":[82],"We":[83,97],"investigate":[84],"properties":[85],"propose":[91],"efficient":[92],"algorithms":[93,100],"to":[94,106],"compute":[95],"them.":[96],"tested":[98],"our":[99],"on":[101],"real":[102],"world":[103],"graphs":[105,121],"verify":[107],"their":[108],"efficiency,":[109],"also":[111],"that":[113],"are":[116],"essential":[117],"studying":[119],"by":[122],"comparing":[123],"normal":[127],"static":[128]},"counts_by_year":[{"year":2026,"cited_by_count":16},{"year":2025,"cited_by_count":29},{"year":2024,"cited_by_count":26},{"year":2023,"cited_by_count":32},{"year":2022,"cited_by_count":31},{"year":2021,"cited_by_count":33},{"year":2020,"cited_by_count":27},{"year":2019,"cited_by_count":26},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":9}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}