{"doi":"10.1007/bf01937481","title":"A parallel search algorithm for directed acyclic graphs","abstract":null,"journal":"BIT","year":1984,"id":44190,"datarank":4.627854153025489,"base_score":3.8918202981106265,"endowment":3.8918202981106265,"self_citation_contribution":0.5837730447165941,"citation_network_contribution":4.0440811083088954,"self_endowment_contribution":0.5837730447165941,"citer_contribution":4.0440811083088954,"corpus_percentile":null,"corpus_rank":null,"citation_count":48,"citer_count":45,"citers_with_citation_signal":32,"citers_with_endowment":32,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":208494,"name":"G. P. Bhattacharjee","orcid":null,"position":1,"is_corresponding":false},{"id":208493,"name":"Ratan K. Ghosh","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":3.8918202981106265,"endowment":3.8918202981106265,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21464855","pmcid":null,"openalex_id":"https://openalex.org/W1978615272","authors":[],"funders":[],"total_grants":0,"fwci":5.6774,"citation_percentile":0.9500539,"influential_citations":0,"citation_trend":[{"year":2012,"count":2},{"year":2016,"count":1},{"year":2017,"count":3},{"year":2018,"count":2},{"year":2019,"count":1},{"year":2022,"count":1},{"year":2023,"count":1},{"year":2025,"count":1},{"year":2026,"count":1}],"oa_status":"closed","license":"http://www.springer.com/tdm","oa_locations":[{"url":"http://link.springer.com/content/pdf/10.1007/BF01937481.pdf","host_type":"publisher"},{"url":"http://link.springer.com/article/10.1007/BF01937481/fulltext.html","host_type":"publisher"},{"url":"http://link.springer.com/content/pdf/10.1007/BF01937481","host_type":"publisher"},{"url":"https://doi.org/10.1007/bf01937481","host_type":"journal"}],"fields_of_study":["Interconnection Networks and Systems","Algorithms and Data Compression","Advanced Graph Theory Research","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Tree traversal","Graph traversal","Directed acyclic graph","Depth-first search","Preorder","Breadth-first search","Parallel algorithm","Computer science","Directed graph","Combinatorics","Algorithm","Tree (set theory)","SIMD","Binary logarithm","Parallel computing","Mathematics","Discrete mathematics","Search algorithm"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-16T21:03:42.050676Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}