{"id":"https://openalex.org/W2569130577","doi":"https://doi.org/10.1109/focs.2012.72","title":"Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings","display_name":"Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings","alternate_titles":[],"publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2569130577","doi":"https://doi.org/10.1109/focs.2012.72","mag":"2569130577"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2012.72","doi":"https://doi.org/10.1109/focs.2012.72","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2012.72","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 53rd Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2569130577"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1204.1616","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975","observed_orcids":["https://orcid.org/0000-0003-2472-2975"]},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]},{"id":"https://openalex.org/I57201433","display_name":"Universit\u00e0 della Svizzera italiana","ror":"https://ror.org/03c4atk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Marek Cygan","raw_affiliation_strings":["IDSIA, University of Lugano, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IDSIA, University of Lugano, Switzerland","institution_ids":["https://openalex.org/I2614128279","https://openalex.org/I57201433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492","observed_orcids":["https://orcid.org/0000-0002-9775-3492"]},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":["Department of Computer Science, University of Colorado, Boulder, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Colorado, Boulder, USA","institution_ids":["https://openalex.org/I188538660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754","observed_orcids":["https://orcid.org/0000-0002-0907-3754"]},"institutions":[{"id":"https://openalex.org/I47996466","display_name":"University of Warmia and Mazury in Olsztyn","ror":"https://ror.org/05s4feg49","country_code":"PL","type":"education","lineage":["https://openalex.org/I47996466"]},{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT","PL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["Department of Computer and System Science, University of Warmia and Mazury, Poland","University of Roma La Sapienza, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and System Science, University of Warmia and Mazury, Poland","institution_ids":["https://openalex.org/I47996466"]},{"raw_affiliation_string":"University of Roma La Sapienza, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9771,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":{"value":0.91662643,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"531","last_page":"540"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T12292","display_name":"Graph Theory and Algorithms","score":9.999999747378752e-05,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0,"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/matrix-multiplication","display_name":"matrix multiplication","score":0.7129999995231628},{"id":"https://openalex.org/keywords/shortest-cycle","display_name":"shortest cycle","score":0.7089999914169312},{"id":"https://openalex.org/keywords/graph-diameter","display_name":"graph diameter","score":0.972000002861023},{"id":"https://openalex.org/keywords/radius","display_name":"radius","score":0.5799999833106995},{"id":"https://openalex.org/keywords/minimum-weight-perfect-matching","display_name":"minimum-weight perfect matching","score":0.9380000233650208},{"id":"https://openalex.org/keywords/undirected-graphs","display_name":"undirected graphs","score":0.6930000185966492},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.6859999895095825},{"id":"https://openalex.org/keywords/matrix-multiplication-algorithms","display_name":"matrix multiplication algorithms","score":0.31700000166893005}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6166375875473022},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5807396173477173},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5119200944900513},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46959105134010315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44798970222473145},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4441545903682709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41952207684516907},{"id":"https://openalex.org/C39096654","wikidata":"https://www.wikidata.org/wiki/Q728507","display_name":"Strassen algorithm","level":4,"score":0.4112872779369354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39317816495895386},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19966435432434082},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.14173924922943115},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/focs.2012.72","doi":"https://doi.org/10.1109/focs.2012.72","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2012.72","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 53rd Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1204.1616","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1204.1616","pdf_url":"https://arxiv.org/pdf/1204.1616","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,"listed_in":[],"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":"doi:10.48550/arxiv.1204.1616","doi":"https://doi.org/10.48550/arxiv.1204.1616","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1204.1616","pdf_url":"https://arxiv.org/pdf/1204.1616","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,"listed_in":[],"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":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.310.889","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.889","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.eecs.umich.edu/~pettie/matching/Cygan-Gabow-Sankowski-general-mincost-matching-matrix-mult.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.750.1776","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.750.1776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1204.1616.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1204.1616","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1204.1616","pdf_url":"https://arxiv.org/pdf/1204.1616","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,"listed_in":[],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2569130577.pdf","grobid_xml":"https://content.openalex.org/works/W2569130577.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W1494735819","https://openalex.org/W1507231083","https://openalex.org/W1509653541","https://openalex.org/W1523833456","https://openalex.org/W1599026900","https://openalex.org/W1823654214","https://openalex.org/W1969573308","https://openalex.org/W1973342538","https://openalex.org/W1977545325","https://openalex.org/W1991858502","https://openalex.org/W1994613175","https://openalex.org/W1995653528","https://openalex.org/W1999848117","https://openalex.org/W2008816808","https://openalex.org/W2022980325","https://openalex.org/W2040326319","https://openalex.org/W2041786457","https://openalex.org/W2045859197","https://openalex.org/W2049500052","https://openalex.org/W2050358029","https://openalex.org/W2054420170","https://openalex.org/W2071406157","https://openalex.org/W2080132708","https://openalex.org/W2090168101","https://openalex.org/W2091299439","https://openalex.org/W2120141762","https://openalex.org/W2123452111","https://openalex.org/W2124852572","https://openalex.org/W2125690626","https://openalex.org/W2136442765","https://openalex.org/W2137572956","https://openalex.org/W2151732151","https://openalex.org/W2151827175","https://openalex.org/W2152290683","https://openalex.org/W2155061423","https://openalex.org/W2166645359","https://openalex.org/W2327315803","https://openalex.org/W2610729871","https://openalex.org/W2950248303","https://openalex.org/W2988480584","https://openalex.org/W4245479004","https://openalex.org/W6983883060"],"related_works":["https://openalex.org/W2151827175","https://openalex.org/W2345548304","https://openalex.org/W1999848117","https://openalex.org/W2159896217","https://openalex.org/W2071406157","https://openalex.org/W2156803748","https://openalex.org/W2045859197","https://openalex.org/W7095813558","https://openalex.org/W7097592747","https://openalex.org/W2144071845"],"abstract_inverted_index":{"Consider":[0],"a":[1,16,57,67,143,175],"directed":[2,41],"or":[3,63],"undirected":[4,43,104],"graph":[5],"with":[6,106],"integral":[7],"edge":[8],"weights":[9],"in":[10,103,130],"[-W,":[11],"W].":[12],"This":[13,122,197],"paper":[14],"introduces":[15],"general":[17],"framework":[18,29,159],"for":[19,55,84,98,117,137,152,163,194],"solving":[20],"problems":[21,75,102],"on":[22,32,187],"such":[23,94,134],"graphs":[24,44,83,105],"using":[25],"matrix":[26],"multiplication.":[27],"The":[28],"is":[30],"based":[31],"the":[33,61,80,148,183],"Baur-Strassen":[34],"Theorem":[35],"and":[36,42,65,78],"Strojohann's":[37],"determinant":[38],"algorithm.":[39],"For":[40,71],"without":[45],"negative":[46,68,108],"cycles":[47,188],"we":[48,76,173],"obtain":[49],"simple":[50,176],"\u00d5(Wn\u03c9)":[51,86,114,177,200],"running":[52],"time":[53,87,115,178,201],"algorithms":[54,88,95],"finding":[56,164],"shortest":[58],"cycle,":[59],"computing":[60],"diameter":[62],"radius,":[64],"detecting":[66],"weight":[69,119],"cycle.":[70],"each":[72],"of":[73,82,100,147,167,189,203],"these":[74,101],"unify":[77],"extend":[79],"class":[81],"which":[85],"are":[89],"known.":[90],"In":[91],"particular":[92],"no":[93],"were":[96],"known":[97],"any":[99],"(potentially)":[107],"weights.":[109],"We":[110,156],"also":[111],"present":[112],"an":[113,124,135,171,199],"algorithm":[116,136,141,179,202],"minimum":[118,153],"perfect":[120,154],"matching.":[121,155],"resolves":[123],"open":[125],"problem":[126],"posed":[127],"by":[128],"Sankowski":[129],"2006,":[131],"who":[132],"presented":[133],"bipartite":[138],"graphs.":[139],"Our":[140],"uses":[142],"novel":[144],"combinatorial":[145],"interpretation":[146],"linear":[149],"program":[150],"dual":[151],"believe":[157],"this":[158],"will":[160],"find":[161,181],"applications":[162],"larger":[165],"spectra":[166],"related":[168],"problems.":[169],"As":[170],"example":[172],"give":[174],"to":[180],"all":[182],"vertices":[184],"that":[185],"lie":[186],"length":[190],"at":[191],"most":[192],"t,":[193],"given":[195],"t.":[196],"improves":[198],"Yuster.":[204]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2569130577","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2017-01-13T00:00:00"}
