{"id":"https://openalex.org/W4416341199","doi":"https://doi.org/10.4230/lipics.sea.2026.27","title":"Cycle Basis Algorithms for Reducing Maximum Edge Participation","display_name":"Cycle Basis Algorithms for Reducing Maximum Edge Participation","publication_year":2025,"publication_date":"2025-11-14","ids":{"openalex":"https://openalex.org/W4416341199","doi":"https://doi.org/10.4230/lipics.sea.2026.27"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2511.10961","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.10961","pdf_url":"https://arxiv.org/pdf/2511.10961","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2511.10961","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100380550","display_name":"Fan Wang","orcid":"https://orcid.org/0000-0003-0100-0320"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wang, Fan","raw_affiliation_strings":["Department of Computer Science, University of California, Irvine, CA, USA"],"raw_orcid":"https://orcid.org/0009-0006-9182-2641","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067702658","display_name":"Sandy Irani","orcid":"https://orcid.org/0000-0002-0642-9436"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Irani, Sandy","raw_affiliation_strings":["Department of Computer Science, University of California, Irvine, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-0642-9436","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10020","display_name":"Quantum Information and Cryptography","score":0.00430000014603138,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0006000000284984708,"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/heuristics","display_name":"Heuristics","score":0.7146000266075134},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.6486999988555908},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.507099986076355},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.42820000648498535},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.39160001277923584},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.3813999891281128},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36719998717308044},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.3517000079154968}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7146000266075134},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.6486999988555908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5924000144004822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5525000095367432},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.507099986076355},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.42820000648498535},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4027000069618225},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.39160001277923584},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.3813999891281128},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36719998717308044},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.3517000079154968},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33739998936653137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33399999141693115},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.28450000286102295},{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.2831999957561493},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2511.10961","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.10961","pdf_url":"https://arxiv.org/pdf/2511.10961","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26031","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol371-sea2026/LIPIcs.SEA.2026.27/LIPIcs.SEA.2026.27.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":"pmh:doi:10.4230/lipics.sea.2026.27","is_oa":true,"landing_page_url":"https://github.com/FanWang000/Cycle_basis_algorithms_public","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2511.10961","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.10961","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.sea.2026.27","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sea.2026.27","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:arXiv.org:2511.10961","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.10961","pdf_url":"https://arxiv.org/pdf/2511.10961","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":null,"license_id":null,"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":{"A":[0],"cycle":[1,15,31,120,160,212,253],"basis":[2,49,121,161,213,241],"of":[3,10,29,33,45,79,105,186,198,200,223],"a":[4,7,66,94,103,143,256],"graph":[5,18,179,235],"is":[6,244],"minimal":[8],"set":[9],"cycles":[11,46,187],"from":[12,136,158],"which":[13,243],"every":[14],"in":[16,47,69,188,220,233,255],"the":[17,27,42,48,77,119,155,159,184,189,195,221,234,239,245],"can":[19,169,215],"be":[20,170,204],"generated":[21],"by":[22,97],"symmetric":[23],"difference.":[24],"We":[25,140],"study":[26],"problem":[28],"constructing":[30],"bases":[32,254],"graphs":[34,131,134],"with":[35],"low":[36],"maximum":[37,43,196,248],"edge":[38,116,152,228,249],"participation,":[39],"defined":[40],"as":[41,73],"number":[44],"that":[50,108,194,210],"share":[51],"any":[52],"single":[53],"edge.":[54],"This":[55],"quantity,":[56],"though":[57],"less":[58],"studied":[59,232],"than":[60],"total":[61],"weight":[62],"or":[63],"length,":[64],"plays":[65],"critical":[67],"role":[68],"quantum":[70,89,138,225],"fault":[71],"tolerance,":[72],"it":[74,166],"directly":[75],"impacts":[76],"overhead":[78],"lattice":[80],"surgery":[81],"procedures":[82],"used":[83],"to":[84,114,147,183],"implement":[85],"an":[86],"almost":[87],"universal":[88],"gate":[90],"set.":[91],"Building":[92],"on":[93,128,133,151,163],"recursive":[95],"algorithm":[96,162],"Freedman":[98],"and":[99,112,132],"Hastings,":[100],"we":[101],"introduce":[102],"family":[104],"load-aware":[106],"heuristics":[107,174,202],"adaptively":[109],"select":[110],"vertices":[111],"edges":[113],"minimize":[115],"participation":[117,229,250],"throughout":[118],"construction.":[122],"Our":[123,191,207],"approach":[124],"improves":[125],"empirical":[126],"performance":[127],"random":[129],"regular":[130],"derived":[135],"small":[137],"codes.":[139],"further":[141],"analyze":[142],"simplified":[144],"balls-into-bins":[145],"process":[146],"establish":[148],"lower":[149],"bounds":[150],"participation.":[153],"While":[154],"model":[156],"differs":[157],"real":[164],"graphs,":[165],"captures":[167],"what":[168],"proven":[171],"for":[172],"our":[173,201],"without":[175],"using":[176],"more":[177],"complex":[178],"theoretic":[180],"properties":[181],"related":[182],"distribution":[185],"graph.":[190,257],"analysis":[192],"suggests":[193],"load":[197],"all":[199,252],"will":[203],"\u03a9(log\u00b2":[205],"n).":[206],"results":[208],"indicate":[209],"careful":[211],"construction":[214],"yield":[216],"significant":[217],"practical":[218],"benefits":[219],"design":[222],"fault-tolerant":[224],"systems.":[226],"Maximum":[227],"has":[230],"been":[231],"theory":[236],"literature":[237],"under":[238],"name":[240],"number,":[242],"minimum":[246],"possible":[247],"over":[251]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-11-18T00:00:00"}