{"id":"https://openalex.org/W2172335165","doi":"https://doi.org/10.1142/s0129626492000155","title":"OPTIMAL TREE RANKING IS IN $\\mathcal{NC}$","display_name":"OPTIMAL TREE RANKING IS IN $\\mathcal{NC}$","publication_year":1992,"publication_date":"1992-03-01","ids":{"openalex":"https://openalex.org/W2172335165","doi":"https://doi.org/10.1142/s0129626492000155","mag":"2172335165"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626492000155","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626492000155","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"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":"Parallel Processing Letters","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/A5089074872","display_name":"Pilar de la Torre","orcid":null},"institutions":[{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"PILAR DE LA TORRE","raw_affiliation_strings":["Department of Computer Science, University of New Hampshire, Durham, NH 03824, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Hampshire, Durham, NH 03824, USA","institution_ids":["https://openalex.org/I161057412"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043885349","display_name":"Raymond Greenlaw","orcid":"https://orcid.org/0000-0003-0690-2112"},"institutions":[{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"RAYMOND GREENLAW","raw_affiliation_strings":["Department of Computer Science, University of New Hampshire, Durham, NH 03824, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Hampshire, Durham, NH 03824, USA","institution_ids":["https://openalex.org/I161057412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089548776","display_name":"Teresa M. Przytycka","orcid":"https://orcid.org/0000-0002-6261-277X"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"TERESA M. PRZYTYCKA","raw_affiliation_strings":["Department of Computer Science, University of Riverside, Riverside, CA 92521, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Riverside, Riverside, CA 92521, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089074872"],"corresponding_institution_ids":["https://openalex.org/I161057412"],"apc_list":null,"apc_paid":null,"fwci":0.4644,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.66637456,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"02","issue":"01","first_page":"31","last_page":"41"},"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.9987999796867371,"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.9987999796867371,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9943000078201294,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9941999912261963,"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/ranking","display_name":"Ranking (information retrieval)","score":0.7885036468505859},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6648423671722412},{"id":"https://openalex.org/keywords/numbering","display_name":"Numbering","score":0.6465859413146973},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.62978196144104},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5607373118400574},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5023276805877686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4890535771846771},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44647279381752014},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.43433499336242676},{"id":"https://openalex.org/keywords/ranking-svm","display_name":"Ranking SVM","score":0.42619845271110535},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4142729938030243},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4103272557258606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35140955448150635},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2840600311756134},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.171976238489151},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1592516303062439}],"concepts":[{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.7885036468505859},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6648423671722412},{"id":"https://openalex.org/C191916993","wikidata":"https://www.wikidata.org/wiki/Q362019","display_name":"Numbering","level":2,"score":0.6465859413146973},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.62978196144104},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5607373118400574},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5023276805877686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4890535771846771},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44647279381752014},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.43433499336242676},{"id":"https://openalex.org/C124975894","wikidata":"https://www.wikidata.org/wiki/Q7293290","display_name":"Ranking SVM","level":3,"score":0.42619845271110535},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4142729938030243},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4103272557258606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35140955448150635},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2840600311756134},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.171976238489151},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1592516303062439},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626492000155","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626492000155","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"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":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2315491162","https://openalex.org/W2562198007","https://openalex.org/W2368840343","https://openalex.org/W4297816538","https://openalex.org/W2031468273","https://openalex.org/W2370100764","https://openalex.org/W2187479119","https://openalex.org/W2073542340","https://openalex.org/W4307011114","https://openalex.org/W3127142483"],"abstract_inverted_index":{"This":[0],"paper":[1],"places":[2],"the":[3,18,31,44,56,121,147,163,175],"optimal":[4,49,96,183],"tree":[5,166,184],"ranking":[6,13,50,53,97,115,167,185],"problem":[7,82],"in":[8,54,98,119,153],"[Formula:":[9,154,158,178],"see":[10,155,159,179],"text].":[11,156],"A":[12],"is":[14,51,63,75,83,116,127,152],"a":[15,40,52,140],"labeling":[16],"of":[17],"nodes":[19,26],"with":[20,39],"natural":[21],"numbers":[22],"such":[23],"that":[24,80,87,120,139],"if":[25],"u":[27],"and":[28],"v":[29],"have":[30,78],"same":[32],"label":[33,42,58,122],"then":[34],"there":[35],"exists":[36],"another":[37],"node":[38,62,126],"greater":[41],"on":[43],"path":[45],"between":[46],"them.":[47],"An":[48,71],"which":[55,144],"largest":[57],"assigned":[59,123],"to":[60,124],"any":[61],"as":[64,66,129,131],"small":[65,130],"possible":[67],"among":[68],"all":[69],"rankings.":[70],"O(n)":[72],"sequential":[73],"algorithm":[74,161,181],"known.":[76],"Researchers":[77],"speculated":[79],"this":[81],"P-complete.":[84],"We":[85,133],"show":[86],"for":[88,162,182],"an":[89,95,187],"n-node":[90],"tree,":[91],"one":[92],"can":[93],"compute":[94],"O(":[99],"log":[100,107],"n)":[101],"time":[102],"using":[103],"n":[104,108],"2":[105],"/":[106],"CREW":[109],"PRAM":[110],"processors.":[111],"In":[112],"fact,":[113],"our":[114],"super":[117,148,164],"critical":[118,149,165],"each":[125],"absolutely":[128],"possible.":[132],"achieve":[134],"these":[135],"results":[136],"by":[137],"showing":[138],"more":[141],"general":[142],"problem,":[143,151,168],"we":[145],"call":[146],"numbering":[150],"No":[157],"text]":[160,180],"approximate":[169,188],"or":[170],"otherwise,":[171],"was":[172,186],"previously":[173],"known;":[174],"only":[176],"known":[177],"one.":[189]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}