{"id":"https://openalex.org/W4297988859","doi":"https://doi.org/10.3390/a15100361","title":"Foremost Walks and Paths in Interval Temporal Graphs","display_name":"Foremost Walks and Paths in Interval Temporal Graphs","publication_year":2022,"publication_date":"2022-09-29","ids":{"openalex":"https://openalex.org/W4297988859","doi":"https://doi.org/10.3390/a15100361"},"language":"en","primary_location":{"id":"doi:10.3390/a15100361","doi":"https://doi.org/10.3390/a15100361","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15100361","pdf_url":"https://www.mdpi.com/1999-4893/15/10/361/pdf?version=1666753742","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","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://www.mdpi.com/1999-4893/15/10/361/pdf?version=1666753742","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":["Adobe Systems Inc., Lehi, UT 84043, USA","Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FL 32611, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Adobe Systems Inc., Lehi, UT 84043, USA","institution_ids":["https://openalex.org/I1306409833"]},{"raw_affiliation_string":"Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FL 32611, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"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 Sahni","raw_affiliation_strings":["Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FL 32611, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FL 32611, 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":1400,"currency":"CHF","value_usd":1466},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1466},"fwci":0.72,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63469129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":"15","issue":"10","first_page":"361","last_page":"361"},"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.9067000150680542,"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.9067000150680542,"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.08900000154972076,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/np-hardness","display_name":"NP-hardness","score":0.9589999914169312},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7070000171661377},{"id":"https://openalex.org/keywords/pseudo-polynomial-time-algorithm","display_name":"pseudo-polynomial time algorithm","score":0.9769999980926514}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6388399004936218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6364466547966003},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5210625529289246},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5168917179107666},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4460681676864624},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42872148752212524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3974708020687103},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39564576745033264},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2955739200115204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29124146699905396},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0727812647819519},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a15100361","doi":"https://doi.org/10.3390/a15100361","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15100361","pdf_url":"https://www.mdpi.com/1999-4893/15/10/361/pdf?version=1666753742","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:7cef4969bee644f9941438e4a0287509","doi":null,"is_oa":true,"landing_page_url":"https://doaj.org/article/7cef4969bee644f9941438e4a0287509","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":"Algorithms, Vol 15, Iss 10, p 361 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a15100361","doi":"https://doi.org/10.3390/a15100361","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15100361","pdf_url":"https://www.mdpi.com/1999-4893/15/10/361/pdf?version=1666753742","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4297988859.pdf","grobid_xml":"https://content.openalex.org/works/W4297988859.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/W1593360408","https://openalex.org/W1881841366","https://openalex.org/W1970700632","https://openalex.org/W2062756620","https://openalex.org/W2115022330","https://openalex.org/W2498592833","https://openalex.org/W2739147373","https://openalex.org/W2945983007","https://openalex.org/W2949219109","https://openalex.org/W3037819556","https://openalex.org/W3091847779","https://openalex.org/W3111728162","https://openalex.org/W4200529087","https://openalex.org/W4200542885"],"related_works":["https://openalex.org/W4200542885","https://openalex.org/W4293531489","https://openalex.org/W4312292484","https://openalex.org/W4403603496","https://openalex.org/W4403882724","https://openalex.org/W4414818242","https://openalex.org/W2498592833","https://openalex.org/W2986811502","https://openalex.org/W2244843312","https://openalex.org/W3034876319"],"abstract_inverted_index":{"The":[0],"min-wait":[1,22,59,107],"foremost,":[2],"min-hop":[3,46,96],"foremost":[4,7,23,26,47,60,97,108],"and":[5,9,24,28,50,82,99],"min-cost":[6,25],"paths":[8,29,48,98],"walks":[10,27,61],"problems":[11],"in":[12,30,63],"interval":[13,31,64],"temporal":[14,32,65],"graphs":[15,33,81],"are":[16],"considered.":[17],"We":[18,36,67],"prove":[19],"that":[20,85],"finding":[21,95,106],"is":[34],"NP-hard.":[35],"develop":[37],"a":[38,51],"polynomial":[39],"time":[40,53],"algorithm":[41,54],"for":[42,55,78,94,105],"the":[43,56],"single-source":[44,57],"all-destinations":[45,58],"problem":[49,62],"pseudopolynomial":[52],"graphs.":[66],"benchmark":[68],"our":[69,86],"algorithms":[70,72,87],"against":[71],"presented":[73],"by":[74],"Bentert":[75],"et":[76],"al.":[77],"contact":[79],"sequence":[80],"show,":[83],"experimentally,":[84],"perform":[88],"up":[89,100],"to":[90,101],"207.5":[91],"times":[92,103],"faster":[93,104],"23.3":[102],"walks.":[109]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2022-10-01T00:00:00"}