{"id":"https://openalex.org/W2088570605","doi":"https://doi.org/10.1016/0020-0190(88)90164-0","title":"An improved parallel algorithm that computes the BFS numbering of a directed graph","display_name":"An improved parallel algorithm that computes the BFS numbering of a directed graph","publication_year":1988,"publication_date":"1988-06-01","ids":{"openalex":"https://openalex.org/W2088570605","doi":"https://doi.org/10.1016/0020-0190(88)90164-0","mag":"2088570605"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(88)90164-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(88)90164-0","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information 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/A5004702242","display_name":"Hillel Gazit","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hillel Gazit","raw_affiliation_strings":["Department of Computer Science, University of Southern California, University Park, Los Angeles, CA 90089-0782, USA","Univ. of Southern California, University Park"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Southern California, University Park, Los Angeles, CA 90089-0782, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"Univ. of Southern California, University Park","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010457003","display_name":"Gary L. Miller","orcid":"https://orcid.org/0000-0001-5456-8097"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gary L. Miller","raw_affiliation_strings":["Department of Computer Science, University of Southern California, University Park, Los Angeles, CA 90089-0782, USA","Univ. of Southern California, University Park"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Southern California, University Park, Los Angeles, CA 90089-0782, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"Univ. of Southern California, University Park","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004702242"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":6.9415,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.96796339,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"28","issue":"2","first_page":"61","last_page":"65"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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.9987000226974487,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9918000102043152,"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/numbering","display_name":"Numbering","score":0.7787513732910156},{"id":"https://openalex.org/keywords/semiring","display_name":"Semiring","score":0.7137933373451233},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.599748432636261},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5898125767707825},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5724779367446899},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4603862762451172},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44119659066200256},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4368177056312561},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4350162744522095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43183690309524536},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4296721816062927},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42463916540145874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42282089591026306},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3870842456817627},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3656115233898163}],"concepts":[{"id":"https://openalex.org/C191916993","wikidata":"https://www.wikidata.org/wiki/Q362019","display_name":"Numbering","level":2,"score":0.7787513732910156},{"id":"https://openalex.org/C21696900","wikidata":"https://www.wikidata.org/wiki/Q1333055","display_name":"Semiring","level":2,"score":0.7137933373451233},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.599748432636261},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5898125767707825},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5724779367446899},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4603862762451172},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44119659066200256},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4368177056312561},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4350162744522095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43183690309524536},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4296721816062927},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42463916540145874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42282089591026306},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3870842456817627},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3656115233898163},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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.1016/0020-0190(88)90164-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(88)90164-0","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W152964218","https://openalex.org/W1655990431","https://openalex.org/W2035476608","https://openalex.org/W2080063509","https://openalex.org/W2107705503","https://openalex.org/W3147056755","https://openalex.org/W6645117220"],"related_works":["https://openalex.org/W2393028428","https://openalex.org/W2385671392","https://openalex.org/W2610737932","https://openalex.org/W2607245078","https://openalex.org/W2117014006","https://openalex.org/W3206162751","https://openalex.org/W1569625216","https://openalex.org/W2532954835","https://openalex.org/W2088570605","https://openalex.org/W2772781679"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}