{"id":"https://openalex.org/W4415249958","doi":"https://doi.org/10.4230/lipics.swat.2026.38","title":"New Algorithms for Girth and Cycle Detection","display_name":"New Algorithms for Girth and Cycle Detection","publication_year":2025,"publication_date":"2025-07-02","ids":{"openalex":"https://openalex.org/W4415249958","doi":"https://doi.org/10.4230/lipics.swat.2026.38"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2507.02061","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2507.02061","pdf_url":"https://arxiv.org/pdf/2507.02061","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2507.02061","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076616592","display_name":"Liam Roditty","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roditty, Liam","raw_affiliation_strings":["Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel"],"raw_orcid":"https://orcid.org/0000-0002-5289-198X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120024561","display_name":"Plia Trabelsi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Trabelsi, Plia","raw_affiliation_strings":["Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel"],"raw_orcid":"https://orcid.org/0009-0009-2633-2349","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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.26621708,"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/T10534","display_name":"Structural Health Monitoring Techniques","score":0.9799000024795532,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10534","display_name":"Structural Health Monitoring Techniques","score":0.9799000024795532,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5697000026702881},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5468000173568726},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.5462999939918518},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.48890000581741333},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.477400004863739},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"Selection algorithm","score":0.3587000072002411},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.35499998927116394},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.33739998936653137}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6935999989509583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.61080002784729},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5697000026702881},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5468000173568726},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.5462999939918518},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.48890000581741333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48500001430511475},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.477400004863739},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37770000100135803},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.3587000072002411},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.33500000834465027},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.3287999927997589},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.321399986743927},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31940001249313354},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C38506071","wikidata":"https://www.wikidata.org/wiki/Q6522941","display_name":"Freivalds' algorithm","level":5,"score":0.3149000108242035},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.3021000027656555},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.29100000858306885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27549999952316284},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.26339998841285706},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2630000114440918}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2507.02061","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2507.02061","pdf_url":"https://arxiv.org/pdf/2507.02061","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26074","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.38","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.38/LIPIcs.SWAT.2026.38.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":"publishedVersion"},{"id":"doi:10.48550/arxiv.2507.02061","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.02061","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"},{"id":"doi:10.4230/lipics.swat.2026.38","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.38","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2507.02061","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2507.02061","pdf_url":"https://arxiv.org/pdf/2507.02061","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0,13],"$G=(V,E)$":[1],"be":[2,15,150],"an":[3,74,90,126,151,212,238],"unweighted":[4],"undirected":[5],"graph":[6,82,245],"with":[7,35,83,171,246],"$n$":[8],"vertices":[9],"and":[10,76,185,195,240,256],"$m$":[11],"edges.":[12],"$g$":[14],"the":[16,22,162,167],"girth":[17],"of":[18,24,39,51,92,100,132,190,222,261],"$G$,":[19],"that":[20,47,96,128,201,218],"is,":[21],"length":[23,52,101,133,223],"a":[25,32,36,49,98,130,172,187,205,220,258],"shortest":[26],"cycle":[27,50,99,131,196,221,263],"in":[28,115,142,166,182],"$G$.":[29],"We":[30,198],"present":[31],"randomized":[33,216],"algorithm":[34,88,91,127,154,217],"running":[37,168,193],"time":[38,169,215],"$\\tilde{O}\\big(\\ell":[40],"\\cdot":[41],"n^{1":[42],"+":[43,117,144],"\\frac{1}{\\ell":[44],"-":[45,60,107,119,176,228],"\\varepsilon}}\\big)$":[46,120],"returns":[48,219],"at":[53,102,134,224],"most":[54,103,135,225],"$":[55,68,114,136,141],"2\\ell":[56,137],"\\left\\lceil":[57,64,110,138],"\\frac{g}{2}":[58,65,105,111,139],"\\right\\rceil":[59,66,106,112,140],"2":[61],"\\left\\lfloor":[62],"\\varepsilon":[63,109,230],"\\right\\rfloor,":[67],"where":[69,147,234],"$\\ell":[70,175],"\\geq":[71],"2$":[72],"is":[73,208,237],"integer":[75,163,239],"$\\varepsilon":[77],"\\in":[78],"[0,1]$,":[79],"for":[80,202,243],"every":[81,244],"$g":[84],"=":[85],"polylog(n)$.":[86],"Our":[87,153],"generalizes":[89,155],"Kadria":[93,122],"\\etal{}":[94,123],"[SODA'22]":[95],"computes":[97],"$4\\left\\lceil":[104],"2\\left\\lfloor":[108],"\\right\\rfloor":[113],"$\\tilde{O}\\big(n^{1":[116,143],"\\frac{1}{2":[118],"time.":[121],"presented":[124],"also":[125,199],"finds":[129],"\\frac{1}{\\ell}}\\big)$":[145],"time,":[146],"$\\ell$":[148,165],"must":[149],"integer.":[152],"this":[156],"algorithm,":[157],"as":[158],"well,":[159],"by":[160,210],"replacing":[161],"parameter":[164,174,183],"exponent":[170],"real-valued":[173],"\\varepsilon$,":[177],"thereby":[178],"offering":[179],"greater":[180],"flexibility":[181],"selection":[184],"enabling":[186],"broader":[188],"spectrum":[189],"combinations":[191],"between":[192],"times":[194],"lengths.":[197],"show":[200],"sparse":[203],"graphs":[204],"better":[206],"tradeoff":[207],"possible,":[209],"presenting":[211],"$\\tilde{O}(\\ell\\cdot":[213],"m^{1+1/(\\ell-\\varepsilon)})$":[214],"$2\\ell(\\lfloor":[226],"\\frac{g-1}{2}\\rfloor)":[227],"2(\\lfloor":[229],"\\lfloor":[231],"\\frac{g-1}{2}\\rfloor":[232],"\\rfloor+1)$,":[233],"$\\ell\\geq":[235],"3$":[236],"$\\varepsilon\\in":[241],"[0,1)$,":[242],"$g=polylog(n)$.":[247],"To":[248],"obtain":[249],"our":[250],"algorithms":[251],"we":[252],"develop":[253],"several":[254],"techniques":[255],"introduce":[257],"formal":[259],"definition":[260],"hybrid":[262],"detection":[264],"algorithms.":[265],"[...]":[266]},"counts_by_year":[],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2025-10-16T00:00:00"}