{"id":"https://openalex.org/W2006052436","doi":"https://doi.org/10.1016/0743-7315(89)90027-0","title":"Parallel-depth search for acyclic digraphs","display_name":"Parallel-depth search for acyclic digraphs","publication_year":1989,"publication_date":"1989-10-01","ids":{"openalex":"https://openalex.org/W2006052436","doi":"https://doi.org/10.1016/0743-7315(89)90027-0","mag":"2006052436"},"language":"en","primary_location":{"id":"doi:10.1016/0743-7315(89)90027-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0743-7315(89)90027-0","pdf_url":null,"source":{"id":"https://openalex.org/S157146593","display_name":"Journal of Parallel and Distributed Computing","issn_l":"0743-7315","issn":["0743-7315","1096-0848"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Parallel and Distributed 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/A5113922466","display_name":"G. Bongiovanni","orcid":null},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"G. Bongiovanni","raw_affiliation_strings":["Department of Mathematics, University of L'Aquila, L'Aquila, Italy","University of L'Aquila, L'Aquila ,Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of L'Aquila, L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"University of L'Aquila, L'Aquila ,Italy#TAB#","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110104135","display_name":"R. Petreschi","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"R. Petreschi","raw_affiliation_strings":["Department ofMathematics, University ofRome \u201cLa Sapienza,\u201d Rome, Italy","University of Rome; Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Department ofMathematics, University ofRome \u201cLa Sapienza,\u201d Rome, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"University of Rome; Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113922466"],"corresponding_institution_ids":["https://openalex.org/I26415053"],"apc_list":{"value":3160,"currency":"USD","value_usd":3160},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15001061,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"7","issue":"2","first_page":"383","last_page":"390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9973000288009644,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/topological-sorting","display_name":"Topological sorting","score":0.7767127752304077},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7448452115058899},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7307419180870056},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6991061568260193},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5375418663024902},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.532218337059021},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5288563370704651},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.5271665453910828},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5032724738121033},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5020143985748291},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48315829038619995},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4803284704685211},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39093875885009766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3752010762691498},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24806034564971924},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23452678322792053}],"concepts":[{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.7767127752304077},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7448452115058899},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7307419180870056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6991061568260193},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5375418663024902},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.532218337059021},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5288563370704651},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.5271665453910828},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5032724738121033},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5020143985748291},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48315829038619995},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4803284704685211},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39093875885009766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3752010762691498},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24806034564971924},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23452678322792053},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0743-7315(89)90027-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0743-7315(89)90027-0","pdf_url":null,"source":{"id":"https://openalex.org/S157146593","display_name":"Journal of Parallel and Distributed Computing","issn_l":"0743-7315","issn":["0743-7315","1096-0848"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Parallel and Distributed Computing","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/253737","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/253737","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.6399999856948853}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W103797413","https://openalex.org/W1766349993","https://openalex.org/W1995040285","https://openalex.org/W1998776409","https://openalex.org/W2024760761","https://openalex.org/W2068822255","https://openalex.org/W2084593768","https://openalex.org/W2085467310","https://openalex.org/W2112747630","https://openalex.org/W2593170163"],"related_works":["https://openalex.org/W2084763084","https://openalex.org/W1519800400","https://openalex.org/W1998712144","https://openalex.org/W4255598955","https://openalex.org/W3088611359","https://openalex.org/W4292730466","https://openalex.org/W3196251681","https://openalex.org/W3179321748","https://openalex.org/W2951616510","https://openalex.org/W2350235717"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}