乐胖代购免代理版

{"id":"https://openalex.org/W2974852703","doi":"https://doi.org/10.1142/s0129054119400276","title":"Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info","display_name":"Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2974852703","doi":"https://doi.org/10.1142/s0129054119400276","mag":"2974852703"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054119400276","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_indexed_in_scopus":true,"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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5071162952","display_name":"Kitti Gelle","orcid":null},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"funder","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Kitti Gelle","raw_affiliation_strings":["Department of Computer Science, University of Szeged, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072375064","display_name":"Szabolcs Iv\u00e1n","orcid":"https://orcid.org/0000-0003-0406-7117"},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"funder","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Szabolcs Iv\u00e1n","raw_affiliation_strings":["Department of Computer Science, University of Szeged, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072375064"],"corresponding_institution_ids":["https://openalex.org/I227486990"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.599613,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":69,"max":74},"biblio":{"volume":"30","issue":"06n07","first_page":"1029","last_page":"1045"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9999,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9999,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9987,"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.9966,"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/characterization","display_name":"Characterization","score":0.6958283},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6910595},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6852931},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.64784217},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.61720103},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.41864654}],"concepts":[{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.6958283},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6910595},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6852931},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.64784217},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.61720103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.56118476},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5606417},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.522432},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48792383},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47574565},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.41864654},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3760924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3365163},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054119400276","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_indexed_in_scopus":true,"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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.48,"display_name":"Peace, justice, and strong institutions","id":"https://metadata.un.org/sdg/16"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":20,"referenced_works":["https://openalex.org/W1589909894","https://openalex.org/W1834231399","https://openalex.org/W1847690346","https://openalex.org/W1874135322","https://openalex.org/W1986022261","https://openalex.org/W1994106054","https://openalex.org/W1999151208","https://openalex.org/W2011039300","https://openalex.org/W2022132320","https://openalex.org/W2029770599","https://openalex.org/W2036743346","https://openalex.org/W2084996778","https://openalex.org/W2089620427","https://openalex.org/W2094777380","https://openalex.org/W2157266926","https://openalex.org/W2162463605","https://openalex.org/W2963334127","https://openalex.org/W4385397173","https://openalex.org/W55887128","https://openalex.org/W56155448"],"related_works":["https://openalex.org/W55187247","https://openalex.org/W4247056703","https://openalex.org/W411819533","https://openalex.org/W264408731","https://openalex.org/W2073363580","https://openalex.org/W2067430117","https://openalex.org/W2058834578","https://openalex.org/W2004734763","https://openalex.org/W1972516737","https://openalex.org/W1891636518"],"abstract_inverted_index":{"Disjoint-Set":[0],"forests,":[1],"consisting":[2],"of":[3,26,63],"Union-Find":[4,82],"trees,":[5],"are":[6,39,84],"data":[7],"structures":[8],"having":[9],"a":[10,32,59,64,75,81],"widespread":[11],"practical":[12],"application":[13],"due":[14],"to":[15],"their":[16],"efficiency.":[17],"Despite":[18],"them":[19],"being":[20],"well-known,":[21],"no":[22],"exact":[23],"structural":[24],"characterization":[25,33,60],"these":[27],"trees":[28,37],"is":[29,80],"known":[30],"(such":[31],"exists":[34],"for":[35,45,51,91],"Union":[36],"which":[38],"constructed":[40],"without":[41],"using":[42],"path":[43],"compression)":[44],"the":[46,71,92],"case":[47],"assuming":[48],"union-by-rank":[49],"strategy":[50],"merging.":[52],"In":[53],"this":[54],"paper":[55],"we":[56],"provide":[57],"such":[58],"by":[61],"means":[62],"simple":[65],"PUSH":[66],"operation":[67],"and":[68],"show":[69],"that":[70],"decision":[72],"problems":[73],"whether":[74],"(ranked":[76],"or":[77],"unranked)":[78],"tree":[79,83],"NP-complete,":[85],"complementing":[86],"our":[87],"earlier":[88],"similar":[89],"result":[90],"union-by-size":[93],"strategy.":[94]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2974852703","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-04-24T15:56:04.307285","created_date":"2019-09-26"}