{"id":"https://openalex.org/W2609053508","doi":"https://doi.org/10.1007/978-3-319-60252-3_12","title":"Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete","display_name":"Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2609053508","doi":"https://doi.org/10.1007/978-3-319-60252-3_12","mag":"2609053508"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-60252-3_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-60252-3_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1704.07254","any_repository_has_fulltext":true},"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":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Kitti Gelle","raw_affiliation_strings":["Department of Computer Science, University of Szeged, Szeged, Hungary","University of Szeged >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Szeged, Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]},{"raw_affiliation_string":"University of Szeged >  >  >  >","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":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Szabolcs Iv\u00e1n","raw_affiliation_strings":["Department of Computer Science, University of Szeged, Szeged, Hungary","University of Szeged >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Szeged, Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]},{"raw_affiliation_string":"University of Szeged >  >  >  >","institution_ids":["https://openalex.org/I227486990"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071162952"],"corresponding_institution_ids":["https://openalex.org/I227486990"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05614939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"152","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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.9955999851226807,"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.9955000281333923,"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/rank","display_name":"Rank (graph theory)","score":0.714614987373352},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.669204831123352},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.6666061878204346},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6608846783638},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.5648838877677917},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5403597354888916},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5181351900100708},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5069287419319153},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4325275123119354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.424813449382782},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3927611708641052}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.714614987373352},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.669204831123352},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.6666061878204346},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6608846783638},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.5648838877677917},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5403597354888916},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5181351900100708},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5069287419319153},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4325275123119354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.424813449382782},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3927611708641052},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-319-60252-3_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-60252-3_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:arXiv.org:1704.07254","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.07254","pdf_url":"https://arxiv.org/pdf/1704.07254","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2609053508","is_oa":true,"landing_page_url":"https://www.arxiv.org/pdf/1704.07254","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:HAL:hal-01657003v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01657003","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.152-163, ⟨10.1007/978-3-319-60252-3_12⟩","raw_type":"Conference papers"},{"id":"doi:10.48550/arxiv.1704.07254","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1704.07254","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1704.07254","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.07254","pdf_url":"https://arxiv.org/pdf/1704.07254","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W55887128","https://openalex.org/W56155448","https://openalex.org/W160379369","https://openalex.org/W1589909894","https://openalex.org/W1834231399","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/W2240057227","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W2963334127","https://openalex.org/W2077157798","https://openalex.org/W1594549999","https://openalex.org/W50739781","https://openalex.org/W3144049911","https://openalex.org/W2949262473","https://openalex.org/W1985064024","https://openalex.org/W2911964621","https://openalex.org/W3122604207","https://openalex.org/W2061520750","https://openalex.org/W1565519167","https://openalex.org/W206001129","https://openalex.org/W3088209886","https://openalex.org/W2206773845","https://openalex.org/W3098804530","https://openalex.org/W2038279323","https://openalex.org/W2256978550","https://openalex.org/W2942410761","https://openalex.org/W3034320979","https://openalex.org/W2034145232"],"abstract_inverted_index":{"Disjoint-Set":[0],"forests,":[1],"consisting":[2],"of":[3,26,63,84],"Union-Find":[4,89],"trees,":[5],"are":[6,39],"data":[7],"structures":[8],"having":[9],"a":[10,32,59,64,76,88],"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,87,91],"known":[30],"(such":[31],"exists":[34],"for":[35,45,51,100],"Union":[36],"which":[38],"constructed":[40],"without":[41],"using":[42],"path":[43],"compression)":[44],"the":[46,72,81,101],"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],"$${\\textsc":[66],"{push}}$$":[67],"operation":[68],"and":[69],"show":[70],"that":[71],"decision":[73],"problem":[74],"whether":[75],"given":[77],"tree":[78,90],"(along":[79],"with":[80],"rank":[82],"info":[83],"its":[85],"nodes)":[86],"$$\\mathbf":[92],"{NP}$$":[93],"-complete,":[94],"complementing":[95],"our":[96],"earlier":[97],"similar":[98],"result":[99],"union-by-size":[102],"strategy.":[103]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}