{"id":"https://openalex.org/W1999230121","doi":"https://doi.org/10.1016/0020-0190(94)00041-7","title":"A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem","display_name":"A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem","publication_year":1994,"publication_date":"1994-06-01","ids":{"openalex":"https://openalex.org/W1999230121","doi":"https://doi.org/10.1016/0020-0190(94)00041-7","mag":"1999230121"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)00041-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00041-7","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/A5079361771","display_name":"Abraham P. Punnen","orcid":"https://orcid.org/0000-0002-3859-9229"},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Abraham P. Punnen","raw_affiliation_strings":["Faculty of administration, University of New Brunswick, Fredericton, NewBrunswick, Canada E3B 5A3"],"affiliations":[{"raw_affiliation_string":"Faculty of administration, University of New Brunswick, Fredericton, NewBrunswick, Canada E3B 5A3","institution_ids":["https://openalex.org/I106938459"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048491326","display_name":"K. P. K. Nair","orcid":null},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"K.P.K. Nair","raw_affiliation_strings":["Faculty of administration, University of New Brunswick, Fredericton, NewBrunswick, Canada E3B 5A3"],"affiliations":[{"raw_affiliation_string":"Faculty of administration, University of New Brunswick, Fredericton, NewBrunswick, Canada E3B 5A3","institution_ids":["https://openalex.org/I106938459"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079361771"],"corresponding_institution_ids":["https://openalex.org/I106938459"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.4733,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.81188508,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"50","issue":"5","first_page":"283","last_page":"286"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973999857902527,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973999857902527,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9962000250816345,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7539377212524414},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7274296879768372},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6810580492019653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.506009042263031},{"id":"https://openalex.org/keywords/biconnected-graph","display_name":"Biconnected graph","score":0.5045238733291626},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4933246672153473},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.48774486780166626},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48328903317451477},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4804510772228241},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4475748836994171},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43917039036750793},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4236070513725281},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40204381942749023},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27563366293907166},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11317232251167297},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.09465497732162476}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7539377212524414},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7274296879768372},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6810580492019653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.506009042263031},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.5045238733291626},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4933246672153473},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.48774486780166626},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48328903317451477},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4804510772228241},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4475748836994171},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43917039036750793},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4236070513725281},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40204381942749023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27563366293907166},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11317232251167297},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.09465497732162476},{"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/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(94)00041-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00041-7","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":11,"referenced_works":["https://openalex.org/W1968182342","https://openalex.org/W2027868217","https://openalex.org/W2041215255","https://openalex.org/W2044028871","https://openalex.org/W2060827745","https://openalex.org/W2109067131","https://openalex.org/W2118382442","https://openalex.org/W2136875057","https://openalex.org/W2140787410","https://openalex.org/W3123213514","https://openalex.org/W6657547486"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857","https://openalex.org/W2521054645","https://openalex.org/W2887154986"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}