{"id":"https://openalex.org/W2133479668","doi":"https://doi.org/10.1142/s0129054110007635","title":"COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY","display_name":"COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY","publication_year":2010,"publication_date":"2010-11-24","ids":{"openalex":"https://openalex.org/W2133479668","doi":"https://doi.org/10.1142/s0129054110007635","mag":"2133479668"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054110007635","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054110007635","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"MAREK KARPI\u0143SKI","raw_affiliation_strings":["Department of Computer Science, University of Bonn, R\u00f6merstrasse 164, 53117 Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, R\u00f6merstrasse 164, 53117 Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078267731","display_name":"Andrzej Ruci\u0144ski","orcid":"https://orcid.org/0000-0002-0742-7694"},"institutions":[{"id":"https://openalex.org/I59411706","display_name":"Adam Mickiewicz University in Pozna\u0144","ror":"https://ror.org/04g6bbq64","country_code":"PL","type":"education","lineage":["https://openalex.org/I59411706"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"ANDRZEJ RUCI\u0143SKI","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 Pozna\u0144, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 Pozna\u0144, Poland","institution_ids":["https://openalex.org/I59411706"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102491884","display_name":"Edyta Szyma\u0144ska","orcid":null},"institutions":[{"id":"https://openalex.org/I59411706","display_name":"Adam Mickiewicz University in Pozna\u0144","ror":"https://ror.org/04g6bbq64","country_code":"PL","type":"education","lineage":["https://openalex.org/I59411706"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"EDYTA SZYMA\u0143SKA","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 Pozna\u0144, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 Pozna\u0144, Poland","institution_ids":["https://openalex.org/I59411706"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108090276"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":3.7586,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.93338265,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"21","issue":"06","first_page":"905","last_page":"924"},"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.9995999932289124,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/mathematics","display_name":"Mathematics","score":0.7473338842391968},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7260977625846863},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.646906852722168},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.559371829032898},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.52309250831604},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5177737474441528},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5153117179870605},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5067327618598938},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.48970988392829895},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.48929187655448914},{"id":"https://openalex.org/keywords/perfect-power","display_name":"Perfect power","score":0.4731284976005554},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.446103036403656},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44067704677581787},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21165400743484497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15320932865142822},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12737888097763062}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7473338842391968},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7260977625846863},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.646906852722168},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.559371829032898},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.52309250831604},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5177737474441528},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5153117179870605},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5067327618598938},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.48970988392829895},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.48929187655448914},{"id":"https://openalex.org/C93446932","wikidata":"https://www.wikidata.org/wiki/Q1972803","display_name":"Perfect power","level":2,"score":0.4731284976005554},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.446103036403656},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44067704677581787},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21165400743484497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15320932865142822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12737888097763062},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054110007635","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054110007635","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.377.4476","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.4476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.cs.uni-bonn.de/~marek/publications/pm-hypergraphs.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1838065876","https://openalex.org/W2070866278","https://openalex.org/W2079325521","https://openalex.org/W2091936180","https://openalex.org/W2093066443","https://openalex.org/W2100061495","https://openalex.org/W2134184632","https://openalex.org/W2144292514","https://openalex.org/W2757464098","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W2100782222","https://openalex.org/W2115404728","https://openalex.org/W3089158720","https://openalex.org/W2173966285","https://openalex.org/W2062172380","https://openalex.org/W2086025566","https://openalex.org/W2132910148","https://openalex.org/W1702487489","https://openalex.org/W3003471035","https://openalex.org/W1457553832"],"abstract_inverted_index":{"In":[0,76,151],"this":[1,77],"paper":[2,78],"we":[3,79,153],"consider":[4,154],"the":[5,10,28,33,61,64,69,87,92,98,107,112,132,138,146,158],"computational":[6],"complexity":[7,156],"of":[8,12,19,35,63,91,100,114,157,164],"deciding":[9],"existence":[11,99,147],"a":[13],"perfect":[14,29,93,108,139],"matching":[15,30,94,109,140],"in":[16,68,125],"certain":[17],"classes":[18,34],"dense":[20],"k-uniform":[21],"hypergraphs.":[22],"It":[23],"has":[24],"been":[25],"known":[26],"that":[27,83,106],"problem":[31,65,110,141,148],"for":[32,50,56,89,111,137,144],"hypergraphs":[36,115,143],"H":[37,116],"with":[38,66,117],"minimum":[39],"((k":[40],"-":[41,121],"1)\u2013wise)":[42],"vertex":[43],"degree\u03b4(H)":[44],"at":[45],"least":[46],"c|V(H)|":[47],"is":[48,85,123,149],"NP-complete":[49],"[Formula:":[51,71],"see":[52,72],"text]":[53,73],"and":[54,96],"trivial":[55],"c":[57,67],"\u2265":[58,119],"\u00bd,":[59],"leaving":[60],"status":[62],"interval":[70],"widely":[74],"open.":[75],"show,":[80],"somehow":[81],"surprisingly,":[82],"\u00bd":[84],"not":[86],"threshold":[88],"tractability":[90],"problem,":[95,159],"prove":[97],"an":[101],"\u03b5":[102],">":[103],"0":[104],"such":[105],"class":[113],"\u03b4(H)":[118],"(\u00bd":[120],"\u03b5)|V(H)|":[122],"solvable":[124],"polynomial":[126,134],"time.":[127],"This":[128],"seems":[129],"to":[130],"be":[131,162],"first":[133],"time":[135],"algorithm":[136],"on":[142],"which":[145,160],"nontrivial.":[150],"addition,":[152],"parallel":[155],"could":[161],"also":[163],"independent":[165],"interest.":[166]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}