{"id":"https://openalex.org/W1577105815","doi":"https://doi.org/10.1016/s0166-218x(02)00218-4","title":"An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree","display_name":"An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree","publication_year":2002,"publication_date":"2002-10-28","ids":{"openalex":"https://openalex.org/W1577105815","doi":"https://doi.org/10.1016/s0166-218x(02)00218-4","mag":"1577105815"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(02)00218-4","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(02)00218-4","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X02002184/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/S0166218X02002184/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073738140","display_name":"Hiroshi Nagamochi","orcid":"https://orcid.org/0000-0002-8332-1517"},"institutions":[{"id":"https://openalex.org/I136259955","display_name":"Toyohashi University of Technology","ror":"https://ror.org/04ezg6d83","country_code":"JP","type":"education","lineage":["https://openalex.org/I136259955"]},{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hiroshi Nagamochi","raw_affiliation_strings":["Department of Information and Computer Sciences, Toyohashi University of Technology, Hibarigaoka Tempaku, Toyohashi Aichi, 4 1-8580, Japan","Kyoto University, Kyoto, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Sciences, Toyohashi University of Technology, Hibarigaoka Tempaku, Toyohashi Aichi, 4 1-8580, Japan","institution_ids":["https://openalex.org/I136259955"]},{"raw_affiliation_string":"Kyoto University, Kyoto, Japan#TAB#","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073738140"],"corresponding_institution_ids":["https://openalex.org/I136259955","https://openalex.org/I22299242"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":null,"fwci":2.3469,"has_fulltext":true,"cited_by_count":61,"citation_normalized_percentile":{"value":0.87222523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"126","issue":"1","first_page":"83","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9983000159263611,"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.8485002517700195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.814079761505127},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6382673978805542},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5595864057540894},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5126208662986755},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5105922818183899},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5002107620239258},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4692673087120056},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46857950091362},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.41813018918037415},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.41581571102142334},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41423502564430237},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16011258959770203},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08485814929008484},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.0841633677482605},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.047176241874694824}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8485002517700195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.814079761505127},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6382673978805542},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5595864057540894},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5126208662986755},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5105922818183899},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5002107620239258},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4692673087120056},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46857950091362},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.41813018918037415},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.41581571102142334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41423502564430237},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16011258959770203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08485814929008484},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0841633677482605},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.047176241874694824},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0166-218x(02)00218-4","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(02)00218-4","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X02002184/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.740","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.kuamp.kyoto-u.ac.jp/labs/or/members/naga/TC/99019.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s0166-218x(02)00218-4","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(02)00218-4","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X02002184/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1577105815.pdf","grobid_xml":"https://content.openalex.org/works/W1577105815.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1548400851","https://openalex.org/W1605196620","https://openalex.org/W1611628598","https://openalex.org/W1981318539","https://openalex.org/W1986478184","https://openalex.org/W1988832992","https://openalex.org/W2003813631","https://openalex.org/W2011999472","https://openalex.org/W2046946959","https://openalex.org/W2051699458","https://openalex.org/W2092113566","https://openalex.org/W2106789991","https://openalex.org/W2118382442","https://openalex.org/W2145527475","https://openalex.org/W2578809778","https://openalex.org/W4234462414","https://openalex.org/W4249807742","https://openalex.org/W6630482551","https://openalex.org/W6646798020"],"related_works":["https://openalex.org/W3099328339","https://openalex.org/W2803918337","https://openalex.org/W3215909732","https://openalex.org/W2790408044","https://openalex.org/W2963355678","https://openalex.org/W2069416867","https://openalex.org/W3208828666","https://openalex.org/W2045430818","https://openalex.org/W2370592213","https://openalex.org/W2113138058"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}