{"id":"https://openalex.org/W4200542885","doi":"https://doi.org/10.1109/iscc53001.2021.9631526","title":"Min Hop and Foremost Paths in Interval Temporal Graphs","display_name":"Min Hop and Foremost Paths in Interval Temporal Graphs","publication_year":2021,"publication_date":"2021-09-05","ids":{"openalex":"https://openalex.org/W4200542885","doi":"https://doi.org/10.1109/iscc53001.2021.9631526"},"language":"en","primary_location":{"id":"doi:10.1109/iscc53001.2021.9631526","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc53001.2021.9631526","pdf_url":null,"source":{"id":"https://openalex.org/S4363605778","display_name":"2021 IEEE Symposium on Computers and Communications (ISCC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-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/A5029512083","display_name":"Anuj Jain","orcid":"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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anuj Jain","raw_affiliation_strings":["Adobe Systems Inc., Lehi, UT, USA"],"affiliations":[{"raw_affiliation_string":"Adobe Systems Inc., Lehi, UT, USA","institution_ids":["https://openalex.org/I1306409833"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070824596","display_name":"Sartaj Sahni","orcid":"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":["University of Florida, Gainesville, FL, USA"],"affiliations":[{"raw_affiliation_string":"University of Florida, Gainesville, FL, 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"],"apc_list":null,"apc_paid":null,"fwci":0.924,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67280418,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9980999827384949,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9941999912261963,"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/speedup","display_name":"Speedup","score":0.7499986886978149},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6296582818031311},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5390457510948181},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4966307282447815},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4881749749183655},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47942084074020386},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.45289507508277893},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4350757896900177},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43451589345932007},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3197707533836365},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2789366543292999},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23747751116752625},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.16791918873786926}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7499986886978149},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6296582818031311},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5390457510948181},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4966307282447815},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4881749749183655},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47942084074020386},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.45289507508277893},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4350757896900177},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43451589345932007},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3197707533836365},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2789366543292999},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23747751116752625},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.16791918873786926},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc53001.2021.9631526","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc53001.2021.9631526","pdf_url":null,"source":{"id":"https://openalex.org/S4363605778","display_name":"2021 IEEE Symposium on Computers and Communications (ISCC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"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/W2498592833","https://openalex.org/W2739147373","https://openalex.org/W2799158821","https://openalex.org/W2945983007","https://openalex.org/W2963681731","https://openalex.org/W2968468046","https://openalex.org/W2973017021","https://openalex.org/W3037819556","https://openalex.org/W3091847779","https://openalex.org/W4200542885","https://openalex.org/W6629690270","https://openalex.org/W6767766197"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W2157978810","https://openalex.org/W2398738602","https://openalex.org/W2965171438"],"abstract_inverted_index":{"We":[0,65],"develop":[1],"algorithms":[2,14,20],"for":[3,22,51,57],"foremost":[4,23,37],"paths":[5,8,26],"and":[6,24],"min-hop":[7,25,59],"in":[9,27,73,81],"interval":[10,75],"temporal":[11,30,76,85],"graphs.":[12,31],"These":[13],"are":[15,71],"benchmarked":[16],"against":[17],"the":[18,48,55,74,82],"fastest":[19,49],"known":[21],"contact":[28,52,83],"sequence":[29,53,84],"On":[32],"our":[33,36,58],"test":[34],"data,":[35],"path":[38,68],"algorithm":[39,50,60],"provides":[40],"a":[41],"speedup":[42,56],"of":[43],"up":[44,62],"to":[45,63],"1800":[46],"over":[47],"graphs;":[54],"is":[61],"6700.":[64],"also":[66],"demonstrate":[67],"problems":[69],"that":[70],"NP-hard":[72],"graph":[77,86],"model":[78],"but":[79],"polynomial":[80],"model.":[87]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}