{"id":"https://openalex.org/W7165759379","doi":"https://doi.org/10.4230/lipics.sand.2026.16","title":"On Sufficient Conditions for Short Journeys in Temporal Graphs","display_name":"On Sufficient Conditions for Short Journeys in Temporal Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165759379","doi":"https://doi.org/10.4230/lipics.sand.2026.16"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26250","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.16/LIPIcs.SAND.2026.16.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.16/LIPIcs.SAND.2026.16.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021373855","display_name":"David Ilcinkas","orcid":"https://orcid.org/0000-0002-0094-4330"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ilcinkas, David","raw_affiliation_strings":["Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400 Talence, France"],"raw_orcid":"https://orcid.org/0000-0002-0094-4330","affiliations":[{"raw_affiliation_string":"Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400 Talence, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045950235","display_name":"Nils Morawietz","orcid":"https://orcid.org/0000-0002-7283-4982"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE","FR"],"is_corresponding":false,"raw_author_name":"Morawietz, Nils","raw_affiliation_strings":["Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400 Talence, France","Institute of Computer Science, Friedrich Schiller University Jena, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7283-4982","affiliations":[{"raw_affiliation_string":"Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400 Talence, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]},{"raw_affiliation_string":"Institute of Computer Science, Friedrich Schiller University Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120774543","display_name":"Antoine Toullalan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210105918","display_name":"Normandie Universit\u00e9","ror":"https://ror.org/01k40cz91","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918"]},{"id":"https://openalex.org/I4210108118","display_name":"Laboratoire d'Informatique, du Traitement de l'Information et des Syst\u00e8mes","ror":"https://ror.org/01f1vfy95","country_code":"FR","type":"facility","lineage":["https://openalex.org/I141576021","https://openalex.org/I4210105918","https://openalex.org/I4210105918","https://openalex.org/I4210105918","https://openalex.org/I4210108118","https://openalex.org/I62396329","https://openalex.org/I88814501"]},{"id":"https://openalex.org/I62396329","display_name":"Universit\u00e9 de Rouen Normandie","ror":"https://ror.org/03nhjew95","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I62396329"]},{"id":"https://openalex.org/I88814501","display_name":"Institut National des Sciences Appliqu\u00e9es Rouen Normandie","ror":"https://ror.org/020ws7586","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I88814501"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Toullalan, Antoine","raw_affiliation_strings":["Universit\u00e9 Le Havre Normandie, Univ Rouen Normandie, INSA Rouen Normandie, Normandie Univ, LITIS UR 4108, F-76600 Le Havre, France"],"raw_orcid":"https://orcid.org/0009-0000-1239-9424","affiliations":[{"raw_affiliation_string":"Universit\u00e9 Le Havre Normandie, Univ Rouen Normandie, INSA Rouen Normandie, Normandie Univ, LITIS UR 4108, F-76600 Le Havre, France","institution_ids":["https://openalex.org/I4210105918","https://openalex.org/I4210108118","https://openalex.org/I62396329","https://openalex.org/I88814501"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":9,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67538874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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.9689000248908997,"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.9689000248908997,"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/T12288","display_name":"Optimization and Search Problems","score":0.008799999952316284,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.704200029373169},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6083999872207642},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5525000095367432},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4984999895095825},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.48510000109672546},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.4713999927043915},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4537000060081482},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.43950000405311584}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7271999716758728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7093999981880188},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.704200029373169},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6083999872207642},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5525000095367432},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5206000208854675},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4984999895095825},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.48510000109672546},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.4713999927043915},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4537000060081482},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.43950000405311584},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.40230000019073486},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3668000102043152},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.34689998626708984},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3361999988555908},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.3305000066757202},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3215999901294708},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.27219998836517334},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.2718000113964081},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.2687999904155731}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26250","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.16/LIPIcs.SAND.2026.16.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.sand.2026.16","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.16","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26250","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.16/LIPIcs.SAND.2026.16.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2465436510","display_name":"TEMPOral GRaph ALgorithms and problems","funder_award_id":"ANR-22-CE48-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165759379.pdf","grobid_xml":"https://content.openalex.org/works/W7165759379.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0,22,76,184],"temporal":[1,27,31,74,298,302],"graph":[2,28,310],"is":[3,29,188,311],"defined":[4],"as":[5,83,130,177],"a":[6,16,26,34,37,55,105,112,139,155,158,215,235,242,265],"sequence":[7],"(G\u2081,":[8],"G\u2082,":[9],"\u2026,":[10],"G_L)":[11],"of":[12,19,33,61,69,132,150,170,180,195,230,241,258,268,288],"static":[13,38,64],"graphs":[14,65,303],"on":[15,295],"common":[17],"set":[18],"n":[20],"vertices.":[21],"strict":[23,70,113,140],"journey":[24,114,141,156,243],"in":[25,36,40,63,72,202],"the":[30,59,67,84,127,133,148,167,171,178,192,200,227,239,289,309],"analogue":[32],"path":[35,106,205,236],"graph,":[39],"which":[41,104,203],"at":[42,49,98,213,249,305],"most":[43,214,250],"one":[44],"edge":[45],"may":[46],"be":[47],"traversed":[48,152],"each":[50,306],"time":[51,101,231,307],"step.":[52],"There":[53],"exists":[54,146],"notable":[56],"connection":[57],"between":[58],"existence":[60,68,240],"paths":[62,172,182],"and":[66,93,109,147,175,209,264],"journeys":[71],"specific":[73],"graphs.":[75],"well-known":[77],"folklore":[78],"result,":[79],"commonly":[80],"referred":[81],"to":[82,117,144,246],"Reachability":[85,134],"Lemma,":[86,135],"states":[87],"that":[88,138,237,300],"for":[89],"two":[90],"vertices":[91,207],"u":[92,108,116,143,174,208,245],"v,":[94,110],"if":[95],"there":[96],"are":[97],"least":[99],"n-1":[100],"steps":[102,232],"during":[103],"connects":[107],"then":[111],"from":[115,142,244],"v":[118,145,176,210,247],"exists.":[119],"Our":[120],"main":[121],"theorem":[122],"extends":[123],"this":[124,163,196],"lemma.":[125],"Under":[126],"same":[128],"assumptions":[129],"those":[131],"we":[136,198,225,284],"prove":[137],"number":[149,179,229],"edges":[151],"by":[153],"such":[154,181,234],"admits":[157],"non-trivial":[159],"upper":[160,256],"bound.":[161],"Furthermore,":[162],"bound":[164,187,257,267],"converges":[165],"toward":[166],"average":[168],"length":[169,212],"connecting":[173,206],"increases.":[183],"corresponding":[185],"lower":[186,266],"also":[189],"established.":[190],"In":[191],"second":[193],"part":[194],"work,":[197],"investigate":[199],"setting":[201],"every":[204],"has":[211],"given":[216],"integer":[217,221],"k.":[218],"For":[219],"an":[220,255],"b":[222,251],"\u2265":[223],"k,":[224,263],"characterize":[226],"sufficient":[228],"containing":[233],"guarantees":[238],"traversing":[248],"edges.":[252],"We":[253],"derive":[254],"\u230a(n-k-1)/(b-k+1)":[259],"\u22c5":[260,271],"(b-1)\u230b":[261],"+":[262,273,275],"\u230a(n-k-1)/(b":[269],"-k+1)\u230b":[270],"(b-1)":[272],"r":[274,278],"k-1,":[276],"where":[277,304],"=":[279],"(n-k-1":[280],"mod":[281],"(b-k+1)).":[282],"Finally,":[283],"present":[285],"several":[286],"applications":[287],"first":[290],"theorem,":[291],"with":[292],"particular":[293],"emphasis":[294],"always":[296],"connected":[297],"graphs,":[299],"is,":[301],"step":[308],"connected.":[312]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2026-06-25T00:00:00"}