{"id":"https://openalex.org/W4393353169","doi":"https://doi.org/10.3390/a17040148","title":"Path Algorithms for Contact Sequence Temporal Graphs","display_name":"Path Algorithms for Contact Sequence Temporal Graphs","publication_year":2024,"publication_date":"2024-03-30","ids":{"openalex":"https://openalex.org/W4393353169","doi":"https://doi.org/10.3390/a17040148"},"language":"en","primary_location":{"id":"doi:10.3390/a17040148","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17040148","pdf_url":"https://www.mdpi.com/1999-4893/17/4/148/pdf?version=1711800444","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,"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"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/17/4/148/pdf?version=1711800444","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074169283","display_name":"Sanaz Gheibi","orcid":null},"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":true,"raw_author_name":"Sanaz Gheibi","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"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073938611","display_name":"Tania Banerjee","orcid":"https://orcid.org/0000-0003-4737-0001"},"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":"Tania Banerjee","raw_affiliation_strings":["Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FL 32611, USA"],"raw_orcid":"https://orcid.org/0000-0003-4737-0001","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"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077570468","display_name":"Sanjay Ranka","orcid":"https://orcid.org/0000-0003-4886-1988"},"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":"Sanjay Ranka","raw_affiliation_strings":["Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FL 32611, USA"],"raw_orcid":"https://orcid.org/0000-0003-4886-1988","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"]}]},{"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":true,"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":1,"corresponding_author_ids":["https://openalex.org/A5070824596","https://openalex.org/A5074169283"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.6131,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65142439,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"17","issue":"4","first_page":"148","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9916999936103821,"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/path","display_name":"Path (computing)","score":0.6337921619415283},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6210512518882751},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.54786616563797},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5317819118499756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3437475562095642},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08126002550125122},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.06866362690925598}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6337921619415283},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6210512518882751},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.54786616563797},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5317819118499756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3437475562095642},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08126002550125122},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.06866362690925598},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a17040148","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17040148","pdf_url":"https://www.mdpi.com/1999-4893/17/4/148/pdf?version=1711800444","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,"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:6ae06b12a10e46a3ae2eb5b5eaa026d6","is_oa":false,"landing_page_url":"https://doaj.org/article/6ae06b12a10e46a3ae2eb5b5eaa026d6","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,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 17, Iss 4, p 148 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a17040148","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17040148","pdf_url":"https://www.mdpi.com/1999-4893/17/4/148/pdf?version=1711800444","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,"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":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4393353169.pdf"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1496893056","https://openalex.org/W1521173874","https://openalex.org/W1599176085","https://openalex.org/W1982440947","https://openalex.org/W1990757206","https://openalex.org/W2015725509","https://openalex.org/W2021262767","https://openalex.org/W2092403378","https://openalex.org/W2112964526","https://openalex.org/W2118347867","https://openalex.org/W2123988414","https://openalex.org/W2140271346","https://openalex.org/W2166460706","https://openalex.org/W2169455356","https://openalex.org/W2421052367","https://openalex.org/W2438284930","https://openalex.org/W2498592833","https://openalex.org/W2567197845","https://openalex.org/W2617438006","https://openalex.org/W2739147373","https://openalex.org/W2752248884","https://openalex.org/W2768382730","https://openalex.org/W2794328882","https://openalex.org/W2914214599","https://openalex.org/W2921749793","https://openalex.org/W2938978472","https://openalex.org/W2968468046","https://openalex.org/W2991501493","https://openalex.org/W3003631397","https://openalex.org/W3027725861","https://openalex.org/W3037819556","https://openalex.org/W3091847779","https://openalex.org/W3116593181","https://openalex.org/W3119793544","https://openalex.org/W3166547661","https://openalex.org/W4200529087","https://openalex.org/W6631054628","https://openalex.org/W6684537826","https://openalex.org/W6756382112"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4243663106"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3],"new":[4],"time-respecting":[5],"graph":[6],"(TRG)":[7],"representation":[8,15,45,50,74],"for":[9,51,64,75],"contact":[10],"sequence":[11,30],"temporal":[12],"graphs.":[13],"Our":[14],"is":[16,36,57],"more":[17],"memory-efficient":[18],"than":[19,38],"previously":[20],"proposed":[21,44],"representations":[22],"and":[23,82],"has":[24],"run-time":[25],"advantages":[26],"over":[27],"the":[28,48,69,76],"ordered":[29],"of":[31,71],"edges":[32],"(OSE)":[33],"representation,":[34],"which":[35],"faster":[37],"other":[39],"known":[40],"representations.":[41],"While":[42],"our":[43,72],"clearly":[46],"outperforms":[47],"OSE":[49],"shallow":[52],"neighborhood":[53],"search":[54],"problems,":[55],"it":[56,61],"not":[58],"evident":[59],"that":[60],"does":[62],"so":[63],"different":[65],"problems.":[66,85],"We":[67],"demonstrate":[68],"competitiveness":[70],"TRG":[73],"single-source":[77],"all-destinations":[78],"fastest,":[79],"min-hop,":[80],"shortest,":[81],"foremost":[83],"paths":[84]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}