{"id":"https://openalex.org/W7157194436","doi":"https://doi.org/10.48550/arxiv.2604.24275","title":"Maximum Matching and Related Problems in Catalytic Logspace","display_name":"Maximum Matching and Related Problems in Catalytic Logspace","publication_year":2026,"publication_date":"2026-04-27","ids":{"openalex":"https://openalex.org/W7157194436","doi":"https://doi.org/10.48550/arxiv.2604.24275"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.24275","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24275","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.2604.24275","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134780030","display_name":"Srijan Chakraborty","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chakraborty, Srijan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134719672","display_name":"Samir Datta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Datta, Samir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134805013","display_name":"Aryan Kusre","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kusre, Aryan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134773141","display_name":"Partha Mukhopadhyay","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mukhopadhyay, Partha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5079147064","display_name":"Amit Sinhababu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sinhababu, Amit","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6385999917984009,"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":0.6385999917984009,"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.2660999894142151,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.030300000682473183,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.7437999844551086},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6848999857902527},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6546000242233276},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5928999781608582},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.564300000667572},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4846000075340271},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4693000018596649},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43630000948905945},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4124999940395355}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7890999913215637},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.7437999844551086},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6848999857902527},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6546000242233276},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6399999856948853},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5928999781608582},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.564300000667572},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49160000681877136},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4846000075340271},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4693000018596649},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43630000948905945},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4124999940395355},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.35030001401901245},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.32120001316070557},{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.31779998540878296},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.3003000020980835},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.2937000095844269},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.28760001063346863},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2711000144481659},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.24275","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24275","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.2604.24275","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24275","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Understanding":[0],"the":[1,20,25,77,96,137,164,199,212,219,240,246],"power":[2],"of":[3,24,79,131,218,225,232],"space-bounded":[4],"computation":[5],"with":[6,43,112],"access":[7],"to":[8,119,148,160,163,177],"catalytic":[9,41],"space":[10],"has":[11,174],"been":[12,175],"an":[13],"important":[14],"theme":[15],"in":[16,29,40,63,66,69,71,83,89,124,142,151,179,201,245],"complexity":[17],"theory":[18],"over":[19],"recent":[21],"years.":[22],"One":[23],"key":[26],"algorithmic":[27],"results":[28],"this":[30,52,109,233],"area":[31],"is":[32,93,234],"that":[33,56,76,108,209],"bipartite":[34],"maximum":[35,100,122,241],"matching":[36,101,123,243],"can":[37,58,86,116,210],"be":[38,87,117,149,161,178],"computed":[39],"logspace":[42],"a":[44,60,80,121,128,189,206,223,235],"polynomial-time":[45],"bound,":[46],"Agarwala":[47],"and":[48,184,194],"Mertz":[49],"(2025).":[50],"In":[51],"paper,":[53],"we":[54,57,134,204],"show":[55,75,107],"construct":[59],"\\emph{maximum":[61,81,138],"matching}":[62,82,249],"\\emph{general":[64,84],"graphs}":[65,85],"CL,":[67],"and,":[68],"fact,":[70],"CLP.":[72],"We":[73,105],"first":[74],"size":[78,244],"determined":[88],"CL.":[90],"Our":[91],"algorithm":[92,98,130,191,208],"based":[94],"on":[95],"linear-algebraic":[97],"for":[99,197,227,238],"by":[102,170,181,215],"Geelen":[103,132],"(2000).":[104],"then":[106],"algorithm,":[110],"along":[111],"some":[113],"new":[114],"ideas,":[115],"used":[118],"\\emph{find}":[120],"general":[125],"graphs.":[126],"Using":[127],"similar":[129],"(1999),":[133],"also":[135],"solve":[136],"rank":[139,200,213],"completion":[140],"problem}":[141,221],"CLP,":[143],"which":[144,173],"was":[145],"previously":[146],"known":[147],"solvable":[150],"deterministic":[152],"polynomial":[153],"time,":[154],"Geelen.":[155],"This":[156],"problem":[157,168],"turns":[158],"out":[159],"equivalent":[162],"\\emph{linear":[165,247],"matroid":[166,248],"intersection}":[167],"(shown":[169],"Murota,":[171],"1995)":[172],"shown":[176],"CLP":[180,207,236],"Agarwala,":[182],"Alekseev,":[183],"Vinciguerra":[185],"(2026).":[186],"Finally,":[187],"using":[188],"PTAS":[190],"Bl\u00e4ser,":[192],"Jindal":[193],"Pandey":[195],"(2018),":[196],"approximating":[198,239],"Edmond's":[202],"problem,":[203],"derive":[205],"approximate":[211],"given":[214],"any":[216,228],"instance":[217],"\\emph{Edmond's":[220],"upto":[222],"factor":[224],"$(1-\\eps)$":[226],"$\\eps\\in(0,1)$.":[229],"An":[230],"application":[231],"bound":[237],"independent":[242],"problem.":[250]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-29T00:00:00"}