{"id":"https://openalex.org/W2037233409","doi":"https://doi.org/10.1137/0220070","title":"Parallel Tree Contraction Part 2: Further Applications","display_name":"Parallel Tree Contraction Part 2: Further Applications","publication_year":1991,"publication_date":"1991-12-01","ids":{"openalex":"https://openalex.org/W2037233409","doi":"https://doi.org/10.1137/0220070","mag":"2037233409"},"language":"en","primary_location":{"id":"doi:10.1137/0220070","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220070","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5010457003","display_name":"Gary L. Miller","orcid":"https://orcid.org/0000-0001-5456-8097"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gary L. Miller","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007364145","display_name":"John H. Reif","orcid":"https://orcid.org/0000-0002-9096-2056"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John H. Reif","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5010457003"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6198,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.95610928,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"20","issue":"6","first_page":"1128","last_page":"1147"},"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.9998000264167786,"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.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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.9979000091552734,"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/binary-logarithm","display_name":"Binary logarithm","score":0.6311978697776794},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5472308397293091},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5125102996826172},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49199363589286804},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4781133532524109},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.4681409001350403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4654947519302368},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.43797796964645386},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42392492294311523},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.41087794303894043},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4025175869464874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3907294273376465}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6311978697776794},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5472308397293091},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5125102996826172},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49199363589286804},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4781133532524109},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.4681409001350403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4654947519302368},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.43797796964645386},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42392492294311523},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.41087794303894043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4025175869464874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3907294273376465},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0220070","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220070","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.4493","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.4493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~reif/paper/miller/ptc2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W108777047","https://openalex.org/W639289183","https://openalex.org/W1480319329","https://openalex.org/W1519160786","https://openalex.org/W1523679426","https://openalex.org/W1525833494","https://openalex.org/W1585069742","https://openalex.org/W1586466644","https://openalex.org/W1588770100","https://openalex.org/W1964053266","https://openalex.org/W1981796679","https://openalex.org/W1994556169","https://openalex.org/W1996215911","https://openalex.org/W2011758726","https://openalex.org/W2012857639","https://openalex.org/W2027501230","https://openalex.org/W2034924661","https://openalex.org/W2048972466","https://openalex.org/W2049413646","https://openalex.org/W2060482148","https://openalex.org/W2071939274","https://openalex.org/W2076458424","https://openalex.org/W2076597612","https://openalex.org/W2079631449","https://openalex.org/W2080132708","https://openalex.org/W2081256023","https://openalex.org/W2116078914","https://openalex.org/W2134008688","https://openalex.org/W2141756364","https://openalex.org/W2148686552","https://openalex.org/W3175367423","https://openalex.org/W4256017664","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2947276586","https://openalex.org/W2013784340","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W3097369619","https://openalex.org/W1994598067","https://openalex.org/W2061496873","https://openalex.org/W2036758175","https://openalex.org/W2023670982","https://openalex.org/W1972433940"],"abstract_inverted_index":{"This":[0],"paper":[1,13,35],"applies":[2],"the":[3,53,81,97],"parallel":[4],"tree":[5,98],"contraction":[6],"techniques":[7],"developed":[8],"in":[9],"Miller":[10],"and":[11,15,41,57,68,86,121,160],"Reif\u2019s":[12],"[Randomness":[14],"Computation,":[16],"Vol.":[17],"5,":[18],"S.":[19],"Micali,":[20],"ed.,":[21],"JAI":[22],"Press,":[23],"1989,":[24],"pp.":[25],"47\u201972]":[26],"to":[27],"a":[28,47,103,118,130,134,150],"number":[29],"of":[30,55,84,99,102,117],"fundamental":[31],"graph":[32,136],"problems.":[33],"The":[34],"presents":[36],"an":[37,58,105,113,122],"$O(\\log":[38,59,106,123],"n)$":[39,60,108,125],"time":[40,93,109,126],"$n":[42],"/":[43],"\\log":[44],"n$":[45],"processor,":[46],"0-sided":[48],"randomized":[49],"algorithm":[50,63,78,94,110,127],"for":[51,64,69,79,95,111,128,133],"testing":[52],"isomorphism":[54,67],"trees,":[56],"time,":[61,76],"n":[62,92],"maximal":[65],"subtree":[66],"common":[70],"subexpression":[71],"elimination.":[72],"An":[73,90],"O(log":[74],"n)":[75],"n-processor":[77],"computing":[80,96,112,129],"canonical":[82,131],"forms":[83],"trees":[85],"subtrees":[87],"is":[88],"given.":[89,139],"Olog":[91],"3-connected":[100],"components":[101],"graph,":[104,120],"^2":[107],"explicit":[114],"planar":[115,119,135],"embedding":[116],"^3":[124],"form":[132],"are":[137],"also":[138],"All":[140],"these":[141],"latter":[142],"algorithms":[143],"use":[144],"only":[145],"$n^{O(1)}":[146],"$":[147],"processors":[148],"on":[149],"Parallel":[151],"Random":[152],"Access":[153],"Machine":[154],"(PRAM)":[155],"model":[156],"with":[157],"concurrent":[158,161],"writes":[159],"reads.":[162]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}