{"id":"https://openalex.org/W2002065932","doi":"https://doi.org/10.1137/090760416","title":"Maximum Cardinality Simple 2-matchings in Subcubic Graphs","display_name":"Maximum Cardinality Simple 2-matchings in Subcubic Graphs","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2002065932","doi":"https://doi.org/10.1137/090760416","mag":"2002065932"},"language":"en","primary_location":{"id":"doi:10.1137/090760416","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090760416","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","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/A5079559219","display_name":"David Hartvigsen","orcid":"https://orcid.org/0000-0001-8353-5577"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Hartvigsen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100382119","display_name":"Yanjun Li","orcid":"https://orcid.org/0000-0002-6277-4189"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yanjun Li","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":1.9144,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.8501925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"21","issue":"3","first_page":"1027","last_page":"1045"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9980999827384949,"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.9979000091552734,"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/mathematics","display_name":"Mathematics","score":0.8897256851196289},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7959909439086914},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6968779563903809},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6933482885360718},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5711960196495056},{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.48314398527145386},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47893887758255005},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4561835825443268},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45423856377601624}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8897256851196289},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7959909439086914},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6968779563903809},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6933482885360718},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5711960196495056},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.48314398527145386},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47893887758255005},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4561835825443268},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45423856377601624},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/090760416","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090760416","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1495632090","https://openalex.org/W1516152095","https://openalex.org/W1592014028","https://openalex.org/W1973995785","https://openalex.org/W1978451969","https://openalex.org/W1982316266","https://openalex.org/W1995435632","https://openalex.org/W1996962956","https://openalex.org/W2008816808","https://openalex.org/W2019720686","https://openalex.org/W2024011816","https://openalex.org/W2047715328","https://openalex.org/W2058677112","https://openalex.org/W2073506427","https://openalex.org/W2087348204","https://openalex.org/W2091299439","https://openalex.org/W2092483998","https://openalex.org/W2102669784","https://openalex.org/W2131433460","https://openalex.org/W2148517677","https://openalex.org/W2159431671","https://openalex.org/W2172285784","https://openalex.org/W2317309498","https://openalex.org/W2327315803","https://openalex.org/W2335389215","https://openalex.org/W2411340147","https://openalex.org/W2470676942","https://openalex.org/W2756557078","https://openalex.org/W2988480584","https://openalex.org/W4233756358","https://openalex.org/W4237105209","https://openalex.org/W4256646394"],"related_works":["https://openalex.org/W2905952571","https://openalex.org/W2975955571","https://openalex.org/W2000144448","https://openalex.org/W2000924970","https://openalex.org/W3003396734","https://openalex.org/W3170219129","https://openalex.org/W2579720493","https://openalex.org/W2798321768","https://openalex.org/W2138928785","https://openalex.org/W1501191738"],"abstract_inverted_index":{"A":[0,24],"simple":[1,25,49,72,100,120],"2-matching":[2,26,101,121],"in":[3,22,51],"a":[4,7,68,71],"graph":[5],"is":[6,15,27],"subset":[8],"of":[9,35,45],"edges":[10,21],"such":[11],"that":[12],"every":[13],"node":[14],"incident":[16],"with":[17],"at":[18,60],"most":[19,61],"two":[20],".":[23],"called":[28],"-restricted":[29,99,119],"if":[30],"it":[31],"contains":[32],"no":[33],"cycles":[34],"length":[36],"or":[37],"less.":[38],"We":[39],"begin":[40],"by":[41,80],"considering":[42],"the":[43,89,94,116],"problem":[44,65],"finding":[46],"maximum":[47,95,117],"cardinality":[48,96,118],"2-matchings":[50],"subcubic":[52,92],"graphs":[53,55],"(i.e.,":[54],"whose":[56],"nodes":[57],"have":[58],"degree":[59],"3).":[62],"For":[63],"this":[64],"we":[66,87],"present":[67],"min-max":[69,108],"theorem,":[70],"polynomial-time":[73,104],"algorithm,":[74],"and":[75,98],"some":[76],"other":[77],"results.":[78],"Then,":[79],"generalizing":[81],"an":[82],"approach":[83],"due":[84],"to":[85],"Vornberger,":[86],"show":[88],"following":[90],"for":[91,110,114],"graphs:":[93],"-":[97],"problems":[102,122],"are":[103,123],"solvable;":[105],"there":[106],"exist":[107],"theorems":[109],"these":[111],"problems;":[112],"and,":[113],",":[115],"NP-hard.":[124]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}