{"id":"https://openalex.org/W2010357409","doi":"https://doi.org/10.1016/s0020-0190(96)00153-6","title":"Finding biconnected components in O(n) time for a class of graphs","display_name":"Finding biconnected components in O(n) time for a class of graphs","publication_year":1996,"publication_date":"1996-11-01","ids":{"openalex":"https://openalex.org/W2010357409","doi":"https://doi.org/10.1016/s0020-0190(96)00153-6","mag":"2010357409"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(96)00153-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(96)00153-6","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/A5083085099","display_name":"Yan Liang","orcid":"https://orcid.org/0009-0008-1573-8194"},"institutions":[{"id":"https://openalex.org/I162817326","display_name":"Indiana University \u2013 Purdue University Fort Wayne","ror":"https://ror.org/01jxzq227","country_code":"US","type":"education","lineage":["https://openalex.org/I162817326"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Y.Daniel Liang","raw_affiliation_strings":["Department of Computer Science, Indiana Purdue University, Fort Wayne, IN 46805, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Indiana Purdue University, Fort Wayne, IN 46805, USA","institution_ids":["https://openalex.org/I162817326"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063302999","display_name":"Chongkye Rhee","orcid":null},"institutions":[{"id":"https://openalex.org/I110325482","display_name":"Eastern Kentucky University","ror":"https://ror.org/012xks909","country_code":"US","type":"education","lineage":["https://openalex.org/I110325482"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chongkye Rhee","raw_affiliation_strings":["Department of Mathematics, Statistics and Computer Science, Eastern Kentucky University, Richmond, KY 40475, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics and Computer Science, Eastern Kentucky University, Richmond, KY 40475, USA","institution_ids":["https://openalex.org/I110325482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083085099"],"corresponding_institution_ids":["https://openalex.org/I162817326"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.5726,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75074708,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"60","issue":"3","first_page":"159","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"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.9990000128746033,"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.9944000244140625,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9864000082015991,"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/combinatorics","display_name":"Combinatorics","score":0.805705189704895},{"id":"https://openalex.org/keywords/biconnected-graph","display_name":"Biconnected graph","score":0.6405096054077148},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5375670194625854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4970562756061554},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.43946871161460876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4200224280357361},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39502638578414917},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39404064416885376},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13282421231269836},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.06650817394256592}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.805705189704895},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.6405096054077148},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5375670194625854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4970562756061554},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.43946871161460876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4200224280357361},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39502638578414917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39404064416885376},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13282421231269836},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.06650817394256592}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0020-0190(96)00153-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(96)00153-6","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1967528652","https://openalex.org/W2071449335","https://openalex.org/W2143474538","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W2587431574","https://openalex.org/W2049572715","https://openalex.org/W2951151475","https://openalex.org/W2117848356","https://openalex.org/W2070764096","https://openalex.org/W1593573721","https://openalex.org/W2397003135","https://openalex.org/W2408404065","https://openalex.org/W2079856162","https://openalex.org/W2912025711"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}