{"id":"https://openalex.org/W2144071845","doi":"https://doi.org/10.1137/060670730","title":"Faster Algorithms for Minimum Cycle Basis in Directed Graphs","display_name":"Faster Algorithms for Minimum Cycle Basis in Directed Graphs","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2144071845","doi":"https://doi.org/10.1137/060670730","mag":"2144071845"},"language":"en","primary_location":{"id":"doi:10.1137/060670730","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060670730","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5075657638","display_name":"Ramesh Hariharan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ramesh Hariharan","raw_affiliation_strings":["ramesh@strandls.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ramesh@strandls.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103099795","display_name":"Telikepalli Kavitha","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Telikepalli Kavitha","raw_affiliation_strings":["kavitha@csa.iisc.ernet.in#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"kavitha@csa.iisc.ernet.in#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010961023","display_name":"Kurt Mehlhorn","orcid":"https://orcid.org/0000-0003-4020-4334"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kurt Mehlhorn","raw_affiliation_strings":["mehlhorn@mpi-sb.mpg.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"mehlhorn@mpi-sb.mpg.de#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6325,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85029693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"38","issue":"4","first_page":"1430","last_page":"1447"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.7843821048736572},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6619542241096497},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6529278755187988},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.5285471677780151},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.4488091468811035},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41684138774871826},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40646135807037354},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39298275113105774},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.23618507385253906},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17527517676353455}],"concepts":[{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.7843821048736572},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6619542241096497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6529278755187988},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5285471677780151},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.4488091468811035},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41684138774871826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40646135807037354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39298275113105774},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.23618507385253906},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17527517676353455},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/060670730","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060670730","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:eprints.iisc.ac.in:18119","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196309","display_name":"NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59270414","host_organization_name":"Indian Institute of Science Bangalore","host_organization_lineage":["https://openalex.org/I59270414"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.6584","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~mehlhorn/ftp/DirectedCycleBasisJournal.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:428101","is_oa":false,"landing_page_url":"http://edoc.mpg.de/428101","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, v.38, 1430-1447 (2008)","raw_type":"Article"},{"id":"pmh:oai:pure.mpg.de:item_1325557","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-1BA5-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W75076678","https://openalex.org/W1495550473","https://openalex.org/W1512276978","https://openalex.org/W1519532587","https://openalex.org/W1529868822","https://openalex.org/W1592018580","https://openalex.org/W1763401657","https://openalex.org/W1966551934","https://openalex.org/W1966878439","https://openalex.org/W1967717294","https://openalex.org/W1979740015","https://openalex.org/W1982845973","https://openalex.org/W1989181778","https://openalex.org/W1990025588","https://openalex.org/W2004308928","https://openalex.org/W2005869405","https://openalex.org/W2099511119","https://openalex.org/W2114654749","https://openalex.org/W2116696334"],"related_works":["https://openalex.org/W1989181778","https://openalex.org/W2071343228","https://openalex.org/W2392320810","https://openalex.org/W2078609410","https://openalex.org/W2951949739","https://openalex.org/W2387724274","https://openalex.org/W282683215","https://openalex.org/W91800244","https://openalex.org/W2074467278","https://openalex.org/W4386448439"],"abstract_inverted_index":{"We":[0,114,163,169,206],"consider":[1],"the":[2,39,62,65,74,89,120,125,158,246,256,260],"problem":[3,18,217,234],"of":[4,92,96,103,122,124,160,184,218,259],"computing":[5,134,219,267],"a":[6,11,20,36,100,108,116,135,140,189,198,209,220,235,268],"minimum":[7,136,221,269],"cycle":[8,30,37,63,90,101,117,137,191,222,244,257,270],"basis":[9,102,109,118,138,223,271],"in":[10,31,38,46,64,73,139,150,192,224,272,277],"directed":[12,21,141,288],"graph.":[13,261],"The":[14,79,129,216,262],"input":[15],"to":[16,187],"this":[17,32,111,233,291],"is":[19,34,54,88,98,127,157,204,240,255],"graph":[22,33,42,142,227,275],"G":[23,104,193],"whose":[24,194],"edges":[25,44,59,71,145],"have":[26],"nonnegative":[27],"weights.":[28],"A":[29,49,94],"actually":[35],"underlying":[40],"undirected":[41,226,274],"with":[43,56,143,197,242],"traversable":[45],"both":[47],"directions.":[48],"$\\{-1,0,1\\}$":[50],"edge":[51,202,237],"incidence":[52,238],"vector":[53,80,112,239,247],"associated":[55,241],"each":[57,243],"cycle:":[58],"traversed":[60,72],"by":[61,85,173,252],"right":[66],"direction":[67,76],"get":[68,77],"1":[69],"and":[70,146,180,245,283],"opposite":[75],"$-1$.":[78],"space":[81,91,248,258],"over":[82,178,249],"$\\mathbb{Q}$":[83],"generated":[84,251],"these":[86,253],"vectors":[87,254],"G.":[93],"set":[95,203],"cycles":[97,126],"called":[99],"if":[105],"it":[106],"forms":[107],"for":[110,133,266,287],"space.":[113],"seek":[115],"where":[119,153],"sum":[121],"weights":[123],"minimum.":[128],"current":[130],"fastest":[131,263],"algorithm":[132,172,186,265,286],"m":[144],"n":[147],"vertices":[148],"runs":[149,276],"$\\tilde{O}(m^{\\omega+1}n)$":[151],"time,":[152],"$\\omega":[154],"<":[155],"2.376$":[156],"exponent":[159],"matrix":[161,176],"multiplication.":[162],"present":[164,208],"an":[165,181,225,273],"$O(m^3n+m^2n^2\\log":[166],"n)$":[167,212,281],"algorithm.":[168,215],"obtain":[170],"our":[171,284],"using":[174],"fast":[175],"multiplication":[177],"rings":[179],"efficient":[182],"extension":[183],"Dijkstra's":[185],"compute":[188],"shortest":[190],"dot":[195],"product":[196],"function":[199],"on":[200],"its":[201],"nonzero.":[205],"also":[207],"simple":[210],"$O(m^2n+mn^2\\log":[211],"Monte":[213],"Carlo":[214],"has":[228],"been":[229],"well":[230],"studied.":[231],"In":[232],"$\\{0,1\\}$":[236],"$\\mathbb{Z}_2$":[250],"known":[264],"$O(m^2n":[278],"+":[279],"mn^2\\log":[280],"time":[282],"randomized":[285],"graphs":[289],"matches":[290],"running":[292],"time.":[293]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}