{"id":"https://openalex.org/W4386211573","doi":"https://doi.org/10.1109/iscc58397.2023.10218173","title":"Optimal Walks in Contact Sequence Temporal Graphs with No Zero Duration Cycle","display_name":"Optimal Walks in Contact Sequence Temporal Graphs with No Zero Duration Cycle","publication_year":2023,"publication_date":"2023-07-09","ids":{"openalex":"https://openalex.org/W4386211573","doi":"https://doi.org/10.1109/iscc58397.2023.10218173"},"language":"en","primary_location":{"id":"doi:10.1109/iscc58397.2023.10218173","doi":"https://doi.org/10.1109/iscc58397.2023.10218173","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc58397.2023.10218173","pdf_url":null,"source":{"id":"https://openalex.org/S4210175722","display_name":"IEEE Symposium on Computers and Communications (ISCC)","issn_l":"1530-1346","issn":["1530-1346","2642-7389"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anuj Jain","raw_affiliation_strings":["Adobe Systems Inc., Lehi, UT, USA"],"raw_orcid":null,"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 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":["University of Florida,CISE Deptt,Gainesville,FL,USA","CISE Deptt, University of Florida, Gainesville, FL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Florida,CISE Deptt,Gainesville,FL,USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"CISE Deptt, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5306,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48653773,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"392","last_page":"398"},"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.9077000021934509,"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.9077000021934509,"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.03139999881386757,"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.00559999980032444,"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.7549999952316284},{"id":"https://openalex.org/keywords/waiting-time-constraints","display_name":"waiting time constraints","score":0.8930000066757202},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.6610000133514404},{"id":"https://openalex.org/keywords/arrival-time","display_name":"time of arrival","score":0.5450000166893005},{"id":"https://openalex.org/keywords/travel-time","display_name":"travel time","score":0.9679999947547913},{"id":"https://openalex.org/keywords/hop","display_name":"Humulus lupulus","score":0.6759999990463257},{"id":"https://openalex.org/keywords/cost","display_name":"cost","score":0.382999986410141},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.40799999237060547},{"id":"https://openalex.org/keywords/algorithmic-complexity","display_name":"algorithmic complexity","score":0.4449999928474426}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5664872527122498},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5607105493545532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5419848561286926},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.5276452302932739},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5238766074180603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46173179149627686},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4456268548965454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3904256820678711},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32831406593322754},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc58397.2023.10218173","doi":"https://doi.org/10.1109/iscc58397.2023.10218173","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc58397.2023.10218173","pdf_url":null,"source":{"id":"https://openalex.org/S4210175722","display_name":"IEEE Symposium on Computers and Communications (ISCC)","issn_l":"1530-1346","issn":["1530-1346","2642-7389"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1496893056","https://openalex.org/W1521173874","https://openalex.org/W1593360408","https://openalex.org/W1881841366","https://openalex.org/W1970700632","https://openalex.org/W1988115140","https://openalex.org/W2062756620","https://openalex.org/W2147427313","https://openalex.org/W2346708467","https://openalex.org/W2498592833","https://openalex.org/W2739147373","https://openalex.org/W2945983007","https://openalex.org/W2949219109","https://openalex.org/W3036685317","https://openalex.org/W3037819556","https://openalex.org/W3091847779","https://openalex.org/W3109967247","https://openalex.org/W3136438357","https://openalex.org/W4200529087","https://openalex.org/W4293531489","https://openalex.org/W4297988859"],"related_works":["https://openalex.org/W2971692958","https://openalex.org/W4309873448","https://openalex.org/W4297988859","https://openalex.org/W4200542885","https://openalex.org/W4393353169","https://openalex.org/W4293531489","https://openalex.org/W4312292484","https://openalex.org/W4401857160","https://openalex.org/W6891543322","https://openalex.org/W4410455281"],"abstract_inverted_index":{"We":[0],"develop":[1],"an":[2],"algorithm":[3,40,59,100,117,127],"to":[4,123,139],"find":[5],"walks":[6,21,116],"in":[7,82],"contact":[8,84],"sequence":[9,85],"temporal":[10,86],"graphs":[11],"that":[12],"have":[13],"no":[14,91],"cycle":[15],"whose":[16],"duration":[17],"is":[18],"zero.":[19],"These":[20],"minimize":[22],"any":[23],"specified":[24],"linear":[25],"combination":[26],"of":[27,57,68,73,79,98,121,128,137],"optimization":[28],"criteria":[29],"such":[30],"as":[31],"arrival":[32],"time,":[33],"travel":[34],"duration,":[35],"hops,":[36],"and":[37,48,133],"cost.":[38],"The":[39],"also":[41],"accommodates":[42],"waiting":[43,50,93],"time":[44,51,94],"constraints.":[45],"When":[46,88],"min":[47],"max":[49],"constraints":[52],"are":[53,90],"specified,":[54],"the":[55,66,71,76,83,96,106,126],"complexity":[56,97],"our":[58,99,114],"is$O(\\vert":[60,101],"V\\vert":[61,102],"+\\vert":[62,103],"E\\vert\\delta)$,":[63],"where$\\vert":[64],"V\\vert$is":[65],"number":[67,72],"vertices,$\\vert":[69],"E\\vert$is":[70],"edges,":[74],"and$\\delta$is":[75],"maximum":[77,92],"out-degree":[78],"a":[80,119,134],"vertex":[81],"graph.":[87],"there":[89],"constraints,":[95],"E\\vert)$.":[104],"On":[105],"test":[107],"data":[108],"used":[109],"by":[110],"Bentert":[111,129],"et":[112,130],"al.,":[113],"optimal":[115],"provides":[118],"speedup":[120],"up":[122,138],"77":[124],"over":[125],"al.":[131],"[1]":[132],"memory":[135],"reduction":[136],"3.2.":[140]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2023-08-29T00:00:00"}