{"id":"https://openalex.org/W4293531489","doi":"https://doi.org/10.1007/s41109-022-00499-3","title":"Algorithms for optimal min hop and foremost paths in interval temporal graphs","display_name":"Algorithms for optimal min hop and foremost paths in interval temporal graphs","publication_year":2022,"publication_date":"2022-08-29","ids":{"openalex":"https://openalex.org/W4293531489","doi":"https://doi.org/10.1007/s41109-022-00499-3"},"language":"en","primary_location":{"id":"doi:10.1007/s41109-022-00499-3","doi":"https://doi.org/10.1007/s41109-022-00499-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41109-022-00499-3","pdf_url":"https://appliednetsci.springeropen.com/counter/pdf/10.1007/s41109-022-00499-3","source":{"id":"https://openalex.org/S3035517252","display_name":"Applied Network Science","issn_l":"2364-8228","issn":["2364-8228"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","dongbi-c","jufo-1","norway-1","oarl","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["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":"Applied Network Science","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://appliednetsci.springeropen.com/counter/pdf/10.1007/s41109-022-00499-3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029512083","display_name":"Anuj Jain","orcid":"https://orcid.org/0000-0002-3837-5014","observed_orcids":["https://orcid.org/0000-0002-3837-5014"]},"institutions":[{"id":"https://openalex.org/I1306409833","display_name":"Adobe Systems (United States)","ror":"https://ror.org/059tvcg64","country_code":"US","type":"company","lineage":["https://openalex.org/I1306409833"]},{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anuj Jain","raw_affiliation_strings":["CISE Department, University of Florida, Gainesville, USA","Engineering Department, Adobe Systems Inc., Lehi, USA"],"raw_orcid":"https://orcid.org/0000-0002-3837-5014","affiliations":[{"raw_affiliation_string":"CISE Department, University of Florida, Gainesville, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Engineering Department, Adobe Systems Inc., Lehi, USA","institution_ids":["https://openalex.org/I1306409833"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070824596","display_name":"Sartaj K. Sahni","orcid":"https://orcid.org/0000-0002-8129-1676","observed_orcids":["https://orcid.org/0000-0002-8129-1676"]},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sartaj K. Sahni","raw_affiliation_strings":["CISE Department, University of Florida, Gainesville, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CISE Department, University of Florida, Gainesville, USA","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029512083"],"corresponding_institution_ids":["https://openalex.org/I1306409833","https://openalex.org/I33213144"],"apc_list":{"value":1290,"currency":"USD","value_usd":1290},"apc_paid":{"value":1290,"currency":"USD","value_usd":1290},"fwci":1.2599,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7733671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":96},"biblio":{"volume":"7","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8295999765396118,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8295999765396118,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.13130000233650208,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.021199999377131462,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-graphs","display_name":"dynamic graphs","score":0.8169999718666077},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.9490000009536743},{"id":"https://openalex.org/keywords/graph-representation","display_name":"graph representation","score":0.3569999933242798}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5298203229904175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5060490965843201},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5050542950630188},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49892091751098633},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47438815236091614},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4634765088558197},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40101322531700134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3258070647716522},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29503828287124634},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09836709499359131}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s41109-022-00499-3","doi":"https://doi.org/10.1007/s41109-022-00499-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41109-022-00499-3","pdf_url":"https://appliednetsci.springeropen.com/counter/pdf/10.1007/s41109-022-00499-3","source":{"id":"https://openalex.org/S3035517252","display_name":"Applied Network Science","issn_l":"2364-8228","issn":["2364-8228"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","dongbi-c","jufo-1","norway-1","oarl","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["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":"Applied Network Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:fc284024378540fda877a694f7dd9419","doi":null,"is_oa":true,"landing_page_url":"https://doaj.org/article/fc284024378540fda877a694f7dd9419","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Applied Network Science, Vol 7, Iss 1, Pp 1-24 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s41109-022-00499-3","doi":"https://doi.org/10.1007/s41109-022-00499-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41109-022-00499-3","pdf_url":"https://appliednetsci.springeropen.com/counter/pdf/10.1007/s41109-022-00499-3","source":{"id":"https://openalex.org/S3035517252","display_name":"Applied Network Science","issn_l":"2364-8228","issn":["2364-8228"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","dongbi-c","jufo-1","norway-1","oarl","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["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":"Applied Network Science","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4293531489.pdf","grobid_xml":"https://content.openalex.org/works/W4293531489.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1496893056","https://openalex.org/W1518080829","https://openalex.org/W1521173874","https://openalex.org/W1881841366","https://openalex.org/W1970700632","https://openalex.org/W2062756620","https://openalex.org/W2077243496","https://openalex.org/W2115022330","https://openalex.org/W2330664568","https://openalex.org/W2498592833","https://openalex.org/W2799158821","https://openalex.org/W2945983007","https://openalex.org/W2949263370","https://openalex.org/W3037819556","https://openalex.org/W3091847779","https://openalex.org/W3098783518","https://openalex.org/W3111728162"],"related_works":["https://openalex.org/W4200542885","https://openalex.org/W4297988859","https://openalex.org/W4312292484","https://openalex.org/W2244843312","https://openalex.org/W4403603496","https://openalex.org/W2498592833","https://openalex.org/W2986811502","https://openalex.org/W4403882724","https://openalex.org/W4414818242","https://openalex.org/W4393353169"],"abstract_inverted_index":{"Abstract":[0],"Path":[1],"problems":[2,192],"are":[3,12,100,195],"fundamental":[4],"to":[5,43,65,86,147,165,227,249],"the":[6,16,19,33,49,73,103,134,150,157,205,214,221,228,231,244],"study":[7],"of":[8,35,55,145,183,213,216,241],"graphs.":[9,97,187],"Temporal":[10],"graphs":[11,13],"in":[14,28,60,94,197,204,211,220],"which":[15,176],"edges":[17,219,242],"connecting":[18],"vertices":[20,75,217],"change":[21],"with":[22],"time.":[23,79],"Min":[24],"hop":[25,89],"paths":[26,39,58,69,90,93,111],"problem":[27,34,59],"a":[29,61,143,181,251],"temporal":[30,62,96,130,172,186,199,208,247,253],"graph":[31,63,131,173,200,209,234,248],"is":[32,163,225],"finding":[36],"time":[37,67],"respecting":[38,68],"from":[40],"source":[41],"vertex":[42,46],"every":[44],"destination":[45,74],"such":[47],"that":[48,70,125,170,190,194,230],"path":[50,140,191],"goes":[51],"through":[52],"minimum":[53],"number":[54,215,240],"edges.":[56],"Foremost":[57],"requires":[64],"find":[66,87],"arrive":[71],"at":[72,76],"earliest":[77],"possible":[78],"In":[80],"this":[81],"paper":[82],"we":[83],"present":[84],"algorithms":[85,99,105,178],"min":[88],"and":[91,109,218],"foremost":[92,108,139],"interval":[95,171,198,246],"These":[98],"benchmarked":[101],"against":[102],"fastest":[104,151],"known":[106],"for":[107,153,159],"min-hop":[110,161],"by":[112],"Wu":[113],"et":[114],"al.":[115],"(IEEE":[116],"Trans":[117],"Knowl":[118],"Data":[119],"Eng":[120],"28(11):2927\u20132942,":[121],"2016a.":[122],"https://doi.org/10.1109/TKDE.2016.2594065":[123],")":[124],"work":[126,179],"on":[127,175],"contact":[128,154,184,206,232],"sequence":[129,155,185,207,233],"model.":[132],"On":[133],"available":[135],"test":[136],"data,":[137],"our":[138,160,177],"algorithm":[141,152,162],"provides":[142],"speedup":[144,158],"up":[146,164],"1800":[148],"over":[149],"graphs;":[156],"6700.":[166],"We":[167,188],"also":[168],"demonstrate":[169],"model":[174,201,210,235],"represents":[180],"superset":[182],"show":[189],"exist":[193],"NP-hard":[196],"but":[202],"polynomial":[203],"terms":[212],"input":[222],"graph.":[223,254],"This":[224],"due":[226],"fact":[229],"may":[236],"require":[237],"much":[238],"larger":[239],"than":[243],"corresponding":[245],"represent":[250],"given":[252]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2022-08-30T00:00:00"}