{"id":"https://openalex.org/W3174143534","doi":"https://doi.org/10.1145/3611653","title":"Experimental Comparison of PC-Trees and PQ-Trees","display_name":"Experimental Comparison of PC-Trees and PQ-Trees","publication_year":2023,"publication_date":"2023-07-31","ids":{"openalex":"https://openalex.org/W3174143534","doi":"https://doi.org/10.1145/3611653","mag":"3174143534"},"language":"en","primary_location":{"id":"doi:10.1145/3611653","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3611653","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5035535802","display_name":"Simon D. Fink","orcid":"https://orcid.org/0000-0002-2754-1195"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Simon D. Fink","raw_affiliation_strings":["University of Passau, Germany"],"raw_orcid":"https://orcid.org/0000-0002-2754-1195","affiliations":[{"raw_affiliation_string":"University of Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042538126","display_name":"Matthias Pfretzschner","orcid":"https://orcid.org/0000-0002-5378-1694"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Pfretzschner","raw_affiliation_strings":["University of Passau, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5378-1694","affiliations":[{"raw_affiliation_string":"University of Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036986694","display_name":"Ignaz Rutter","orcid":"https://orcid.org/0000-0002-3794-4406"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ignaz Rutter","raw_affiliation_strings":["University of Passau, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3794-4406","affiliations":[{"raw_affiliation_string":"University of Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1632,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51068121,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"28","issue":null,"first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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.9987000226974487,"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/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9976999759674072,"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/implementation","display_name":"Implementation","score":0.8200458288192749},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7113480567932129},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6411088705062866},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5882574915885925},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.4821043312549591},{"id":"https://openalex.org/keywords/template","display_name":"Template","score":0.41594335436820984},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4129263758659363},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4012237787246704},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3895476758480072},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3336092233657837},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.28734660148620605},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15251541137695312},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11613956093788147},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.07063034176826477}],"concepts":[{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.8200458288192749},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7113480567932129},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6411088705062866},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5882574915885925},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.4821043312549591},{"id":"https://openalex.org/C82714645","wikidata":"https://www.wikidata.org/wiki/Q438331","display_name":"Template","level":2,"score":0.41594335436820984},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4129263758659363},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4012237787246704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3895476758480072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3336092233657837},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.28734660148620605},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15251541137695312},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11613956093788147},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.07063034176826477}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3611653","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3611653","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4516621585","display_name":null,"funder_award_id":"RU-1903/3-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W112131548","https://openalex.org/W564800084","https://openalex.org/W634834491","https://openalex.org/W1487973309","https://openalex.org/W1519244190","https://openalex.org/W1594437943","https://openalex.org/W1971080253","https://openalex.org/W2024491681","https://openalex.org/W2055650273","https://openalex.org/W2059074458","https://openalex.org/W2105685244","https://openalex.org/W2797323901","https://openalex.org/W4248028038"],"related_works":["https://openalex.org/W2008433633","https://openalex.org/W1968687912","https://openalex.org/W2491277646","https://openalex.org/W2067642082","https://openalex.org/W4252484868","https://openalex.org/W2058642825","https://openalex.org/W2064750939","https://openalex.org/W1602392394","https://openalex.org/W1981500574","https://openalex.org/W2044738414"],"abstract_inverted_index":{"PQ-trees":[0,56,185],"and":[1,11,76,100,135,142,196,272],"PC-trees":[2,32,234],"are":[3,33,187,235],"data":[4,167],"structures":[5],"that":[6,18,43,61,70,186,203,233],"represent":[7],"sets":[8],"of":[9,21,46,66,112,123,181,184,194,228],"linear":[10],"circular":[12],"orders,":[13],"respectively,":[14],"subject":[15],"to":[16,24,29,72,82,94,178,230,258],"constraints":[17],"specific":[19],"subsets":[20],"elements":[22,47],"have":[23,71],"be":[25,73,92,259],"consecutive.":[26],"While":[27],"equivalent":[28],"each":[30],"other,":[31],"conceptually":[34,238],"much":[35],"simpler":[36,239],"than":[37],"PQ-trees;":[38],"updating":[39],"a":[40,44,52,156,165,179,226,253],"PC-tree":[41,86,205],"so":[42],"set":[45],"becomes":[48],"consecutive":[49],"requires":[50],"only":[51,108,237],"single":[53],"operation,":[54],"whereas":[55],"use":[57,155],"an":[58,170],"update":[59],"procedure":[60],"is":[62,88],"described":[63],"in":[64,105,138,243],"terms":[65],"nine":[67],"transformation":[68],"templates":[69],"recursively":[74],"matched":[75],"applied.":[77],"Despite":[78],"these":[79],"theoretical":[80],"advantages,":[81],"date":[83],"no":[84],"practical":[85],"implementation":[87,215],"available.":[89],"This":[90],"might":[91],"due":[93],"the":[95,110,113,126,131,139,147,151,162,190,213,217,248,264,268],"original":[96,148],"description":[97,269],"by":[98,133,225,270],"Hsu":[99,134,271],"McConnell":[101],"[":[102,220],"14":[103],"]":[104],"some":[106],"places":[107],"sketching":[109],"details":[111,141],"implementation.":[114],"In":[115,169],"this":[116],"paper,":[117],"we":[118,129,154,174,246],"describe":[119],"two":[120],"alternative":[121],"implementations":[122,177,183,206],"PC-trees.":[124],"For":[125,150],"first":[127],"one,":[128,153],"follow":[130],"approach":[132],"McConnell,":[136],"filling":[137],"necessary":[140],"also":[143,241],"proposing":[144],"improvements":[145],"on":[146,189,267],"algorithm.":[149],"second":[152],"different":[157],"technique":[158],"for":[159],"efficiently":[160],"representing":[161],"tree":[163],"using":[164],"Union-Find":[166],"structure.":[168],"extensive":[171],"experimental":[172],"evaluation":[173],"compare":[175],"our":[176],"variety":[180],"other":[182,197],"available":[188],"web":[191],"as":[192,261,263],"part":[193],"academic":[195],"software":[198],"libraries.":[199],"Our":[200],"results":[201],"show":[202],"both":[204],"beat":[207],"their":[208],"closest":[209],"fully":[210],"correct":[211],"competitor,":[212],"PQ-tree":[214],"from":[216],"OGDF":[218],"library":[219],"6":[221],",":[222],"15":[223],"],":[224],"factor":[227],"2":[229],"4,":[231],"showing":[232],"not":[236],"but":[240],"fast":[242,262],"practice.":[244],"Moreover,":[245],"find":[247],"Union-Find-based":[249],"implementation,":[250],"while":[251],"having":[252],"slightly":[254],"worse":[255],"asymptotic":[256],"runtime,":[257],"twice":[260],"one":[265],"based":[266],"McConnell.":[273]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}