{"id":"https://openalex.org/W7165789448","doi":"https://doi.org/10.48550/arxiv.2606.24675","title":"A Congestion Parameter for Depth-First Graph Traversals","display_name":"A Congestion Parameter for Depth-First Graph Traversals","publication_year":2026,"publication_date":"2026-06-23","ids":{"openalex":"https://openalex.org/W7165789448","doi":"https://doi.org/10.48550/arxiv.2606.24675"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.24675","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.24675","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.24675","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139264530","display_name":"Codaline Bourotte","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bourotte, Codaline","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119789567","display_name":"Gwendal Ducloz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ducloz, Gwendal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058753686","display_name":"Pekka Orponen","orcid":"https://orcid.org/0000-0002-0417-2104"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Orponen, Pekka","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002387043","display_name":"Shinnosuke Seki","orcid":"https://orcid.org/0000-0002-0276-3322"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seki, Shinnosuke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.3783999979496002,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.3783999979496002,"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/T11476","display_name":"Graph theory and applications","score":0.14069999754428864,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.10859999805688858,"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/graph","display_name":"Graph","score":0.5638999938964844},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.34540000557899475},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.33899998664855957},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.3167000114917755},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.28459998965263367}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6669999957084656},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.572700023651123},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5638999938964844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4683000147342682},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.33899998664855957},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28690001368522644},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.28459998965263367},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.24500000476837158}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.24675","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.24675","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.24675","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.24675","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,72,89],"explore":[1],"a":[2,21,27,46,129],"new":[3],"graph":[4,47,98,130],"parameter,":[5],"the":[6,11,42,51,59,70,107,120],"KLX":[7,43,83,92,132],"number,":[8],"which":[9],"quantifies":[10],"minimum":[12],"edge":[13],"congestion":[14],"of":[15,20,37,45,58,62],"depth-first":[16],"search":[17],"(DFS)":[18],"traversals":[19],"given":[22],"graph.":[23],"Originally":[24],"motivated":[25],"by":[26],"problem":[28],"in":[29,140],"RNA":[30],"nanostructure":[31],"design,":[32],"this":[33,123],"parameter":[34],"is":[35,48,112],"also":[36,90],"independent":[38],"theoretical":[39],"interest.":[40],"Informally,":[41],"number":[44,61,133],"defined":[49],"as":[50],"minimum,":[52],"over":[53],"all":[54],"its":[55],"DFS":[56],"traversals,":[57],"maximum":[60],"back":[63],"edges":[64],"that":[65,96,106,126],"are":[66],"simultaneously":[67],"open":[68],"during":[69],"traversal.":[71],"provide":[73],"full":[74],"characterisations":[75],"and":[76,87],"linear-time":[77],"recognition":[78],"algorithms":[79],"for":[80,114,143],"graphs":[81],"with":[82,119],"numbers":[84],"0,":[85],"1":[86],"2.":[88],"relate":[91],"to":[93],"tree-width,":[94],"proving":[95],"any":[97,144],"satisfies":[99],"$\\mathrm{TW}":[100],"\\le":[101,110],"\\mathrm{KLX}+1$.":[102],"Furthermore,":[103],"we":[104],"show":[105],"property":[108],"$\\mathrm{KLX}":[109],"k$":[111],"$\\mathrm{MSO}_2$-expressible":[113],"every":[115],"fixed":[116],"$k$.":[117,146],"Combined":[118],"tree-width":[121],"bound,":[122],"result":[124],"implies":[125],"determining":[127],"whether":[128],"has":[131],"at":[134],"most":[135],"$k$":[136],"can":[137],"be":[138],"achieved":[139],"linear":[141],"time":[142],"constant":[145]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-25T00:00:00"}