{"id":"https://openalex.org/W2030543286","doi":"https://doi.org/10.1002/rsa.3240020207","title":"Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph","display_name":"Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W2030543286","doi":"https://doi.org/10.1002/rsa.3240020207","mag":"2030543286"},"language":"en","primary_location":{"id":"doi:10.1002/rsa.3240020207","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240020207","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & Algorithms","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/A5019297501","display_name":"Martin Dyer","orcid":"https://orcid.org/0000-0002-2018-0374"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Martin Dyer","raw_affiliation_strings":["School of Computer Studies, University of Leeds, Leeds, United Kingdom","School of Computer Studies, University of Leeds, Leeds, United Kingdom#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Studies, University of Leeds, Leeds, United Kingdom","institution_ids":["https://openalex.org/I130828816"]},{"raw_affiliation_string":"School of Computer Studies, University of Leeds, Leeds, United Kingdom#TAB#","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076629991","display_name":"Alan Friezet","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Friezet","raw_affiliation_strings":["Department of Mathematics, Carnegie-Mellon University, Pittsburgh, PA 15213","Department of Mathematics Carnegie-Mellon University Pittsburgh - Pa 15213"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Carnegie-Mellon University, Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Department of Mathematics Carnegie-Mellon University Pittsburgh - Pa 15213","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019297501"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.14798705,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":"2","first_page":"233","last_page":"239"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"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.9991999864578247,"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.9945999979972839,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.853919506072998},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.7842998504638672},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.6919656991958618},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5706124305725098},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5371613502502441},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5203135013580322},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4779905676841736},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4356152415275574},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.42017459869384766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3914414048194885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3593757748603821},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34648582339286804},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2858089804649353}],"concepts":[{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.853919506072998},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7842998504638672},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.6919656991958618},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5706124305725098},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5371613502502441},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5203135013580322},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4779905676841736},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4356152415275574},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.42017459869384766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3914414048194885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3593757748603821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34648582339286804},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2858089804649353}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/rsa.3240020207","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240020207","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6885142738","display_name":null,"funder_award_id":"RG0088/89","funder_id":"https://openalex.org/F4320307849","funder_display_name":"North Atlantic Treaty Organization"}],"funders":[{"id":"https://openalex.org/F4320307849","display_name":"North Atlantic Treaty Organization","ror":"https://ror.org/05xagc088"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W639289183","https://openalex.org/W1968067819","https://openalex.org/W2020283440","https://openalex.org/W2037752639","https://openalex.org/W2049327803","https://openalex.org/W2081298180","https://openalex.org/W2085467310","https://openalex.org/W2151636922","https://openalex.org/W4301441647"],"related_works":["https://openalex.org/W2030543286","https://openalex.org/W2026678693","https://openalex.org/W2008046591","https://openalex.org/W2037710955","https://openalex.org/W2031313188","https://openalex.org/W3098335909","https://openalex.org/W1593855989","https://openalex.org/W2917772249","https://openalex.org/W2379239606","https://openalex.org/W2282636749"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"describe":[2],"an":[3],"O":[4],"((log":[5],"n)":[6],"2":[7],")":[8],"time":[9],"parallel":[10],"algorithm,":[11],"using":[12],"n":[13],"processors,":[14],"for":[15,40],"finding":[16],"the":[17,25],"lexicographically":[18],"first":[19,21],"depth":[20],"search":[22],"tree":[23],"in":[24],"random":[26],"graph":[27],"G":[28],"n,":[29],"p":[30,33],",":[31,42],"with":[32],"fixed.":[34],"The":[35],"problem":[36],"itself":[37],"is":[38,45],"complete":[39],"P":[41],"and":[43],"so":[44],"unlikely":[46],"to":[47],"be":[48],"efficiently":[49],"parallelizable":[50],"always.":[51]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}