{"id":"https://openalex.org/W2115036101","doi":"https://doi.org/10.1002/net.3230160305","title":"On finding steiner vertices","display_name":"On finding steiner vertices","publication_year":1986,"publication_date":"1986-09-01","ids":{"openalex":"https://openalex.org/W2115036101","doi":"https://doi.org/10.1002/net.3230160305","mag":"2115036101"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230160305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230160305","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5003354242","display_name":"V. J. Rayward\u2010Smith","orcid":"https://orcid.org/0000-0003-2432-853X"},"institutions":[{"id":"https://openalex.org/I1118541","display_name":"University of East Anglia","ror":"https://ror.org/026k5mg93","country_code":"GB","type":"education","lineage":["https://openalex.org/I1118541"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"V. J. Rayward\u2010Smith","raw_affiliation_strings":["School of Information Systems, University of East Anglia, Norwich NR4 7TJ, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Systems, University of East Anglia, Norwich NR4 7TJ, UK","institution_ids":["https://openalex.org/I1118541"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022768418","display_name":"A.R. Clare","orcid":null},"institutions":[{"id":"https://openalex.org/I1118541","display_name":"University of East Anglia","ror":"https://ror.org/026k5mg93","country_code":"GB","type":"education","lineage":["https://openalex.org/I1118541"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. Clare","raw_affiliation_strings":["School of Information Systems, University of East Anglia, Norwich NR4 7TJ, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Systems, University of East Anglia, Norwich NR4 7TJ, UK","institution_ids":["https://openalex.org/I1118541"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1118541"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":4.4258,"has_fulltext":false,"cited_by_count":159,"citation_normalized_percentile":{"value":0.94210925,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"16","issue":"3","first_page":"283","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8519649505615234},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8316470384597778},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6013486981391907},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5384606719017029},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4987375736236572},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4774352014064789},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.47105857729911804},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.41815829277038574},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3637212812900543},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.21866577863693237}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8519649505615234},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8316470384597778},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6013486981391907},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5384606719017029},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4987375736236572},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4774352014064789},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.47105857729911804},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.41815829277038574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3637212812900543},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.21866577863693237}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230160305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230160305","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":18,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1975290397","https://openalex.org/W1984745150","https://openalex.org/W1996668544","https://openalex.org/W2007572995","https://openalex.org/W2008771115","https://openalex.org/W2017927472","https://openalex.org/W2020112047","https://openalex.org/W2060380213","https://openalex.org/W2066194644","https://openalex.org/W2079798601","https://openalex.org/W2082150701","https://openalex.org/W2115616619","https://openalex.org/W2132087752","https://openalex.org/W2169528473","https://openalex.org/W2401610261","https://openalex.org/W3127447045","https://openalex.org/W6667343178"],"related_works":["https://openalex.org/W1584380088","https://openalex.org/W2099915933","https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2015718828","https://openalex.org/W4295683043","https://openalex.org/W3141326665","https://openalex.org/W2047517090","https://openalex.org/W2803918337","https://openalex.org/W2045430818"],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"a":[2],"graph":[3],"G":[4,15,39],"=":[5],"(":[6],"V,":[7],"E":[8],"),":[9],"finding":[10,30],"the":[11,31,36,51,74],"Steiner":[12,54],"tree":[13,34],"in":[14,35,69],"for":[16],"some":[17],"set":[18,52],"of":[19,38,53,62,66,76],"special":[20],"vertices":[21,65],"V":[22,25,42,45,48,67,70],"\u2032":[23,43],"\u2282":[24],"\u2033,":[26,46],"is":[27,50],"equivalent":[28],"to":[29],"minimum":[32],"spanning":[33],"subgraph":[37],"induced":[40],"by":[41],"\u222a":[44],"where":[47],"\u2033":[49,71],"vertices.":[55],"In":[56],"this":[57],"paper,":[58],"we":[59],"consider":[60],"ways":[61],"deciding":[63],"which":[64],"are":[68],"and":[72],"compare":[73],"performance":[75],"various":[77],"heuristic":[78],"algorithms.":[79]},"counts_by_year":[{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}