{"id":"https://openalex.org/W182377612","doi":null,"title":"A Parallel Tree Contraction Algorithm","display_name":"A Parallel Tree Contraction Algorithm","publication_year":1987,"publication_date":"1987-08-01","ids":{"openalex":"https://openalex.org/W182377612","mag":"182377612"},"language":"en","primary_location":{"id":"mag:182377612","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=901782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5060334068","display_name":"Karl Abrahamson","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Karl Abrahamson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038757706","display_name":"Norm Dadoun","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Norm Dadoun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069172477","display_name":"David G. Kirkpatrick","orcid":"https://orcid.org/0000-0002-3276-2734","observed_orcids":["https://orcid.org/0000-0002-3276-2734"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Kirkpatrick","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-3276-2734","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089548776","display_name":"Teresa M. Przytycka","orcid":"https://orcid.org/0000-0002-6261-277X","observed_orcids":["https://orcid.org/0000-0002-6261-277X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Teresa M. Przytycka","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":0.4437,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.49326221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6244999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6244999766349792,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.24320000410079956,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.059700001031160355,"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/tree-contraction","display_name":"tree contraction","score":0.9940000176429749},{"id":"https://openalex.org/keywords/list-ranking","display_name":"list ranking","score":0.9079999923706055},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.968999981880188},{"id":"https://openalex.org/keywords/cographs","display_name":"cographs","score":0.6190000176429749},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.43299999833106995}],"concepts":[{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.5700779557228088},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5512564182281494},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5467797517776489},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5282052159309387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5130180716514587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.502023458480835},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4662071168422699},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.4622924029827118},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44194960594177246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43880540132522583},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37898755073547363},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35846734046936035},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3002081513404846},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1885431706905365},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:182377612","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=901782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1965874601","https://openalex.org/W2612769605","https://openalex.org/W7098706944","https://openalex.org/W7097855281","https://openalex.org/W2240426913","https://openalex.org/W7099377671","https://openalex.org/W7099249444","https://openalex.org/W7100524173","https://openalex.org/W1525833494","https://openalex.org/W2037233409"],"abstract_inverted_index":{"A":[0,45],"simple":[1],"reduction":[2,16],"from":[3],"the":[4,9,54,67],"tree":[5,23,35,50,55],"contraction":[6,36,56],"problem":[7,12],"to":[8,52,66],"list":[10,43],"ranking":[11],"is":[13,59],"presented.":[14],"The":[15],"takes":[17],"O$(\\log":[18],"n)$":[19,31],"time":[20],"for":[21],"a":[22],"with":[24],"$n$":[25],"nodes,":[26],"using":[27],"O$(n":[28],"/":[29],"\\log":[30],"EREW":[32],"processors.":[33],"Thus":[34],"can":[37],"be":[38],"done":[39],"as":[40,42],"efficiently":[41],"ranking.":[44],"broad":[46],"class":[47],"of":[48,69,72],"parallel":[49],"computations":[51],"which":[53],"techniques":[57],"apply":[58],"described.":[60],"This":[61],"subsumes":[62],"earlier":[63],"characterizations.":[64],"Applications":[65],"computation":[68],"certain":[70],"properties":[71],"cographs":[73],"are":[74],"presented":[75],"in":[76],"some":[77],"detail.":[78]},"counts_by_year":[],"updated_date":"2026-09-22T06:50:58.402377","created_date":"2016-06-24T00:00:00"}