{"id":"https://openalex.org/W1968990355","doi":"https://doi.org/10.1002/net.3230160207","title":"The minimum augmentation of a directed tree to a <i>k</i>\u2010edge\u2010connected directed graph","display_name":"The minimum augmentation of a directed tree to a <i>k</i>\u2010edge\u2010connected directed graph","publication_year":1986,"publication_date":"1986-06-01","ids":{"openalex":"https://openalex.org/W1968990355","doi":"https://doi.org/10.1002/net.3230160207","mag":"1968990355"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230160207","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230160207","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/A5002482954","display_name":"Yoji Kajitani","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoji Kajitani","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, Tokyo Institute of Technology, O-okayama Meguro-ku, Tokyo 152, Japan","Department of Electrical and Electronic Engineering, Tokyo Institute of Technology, O-okayama, Meguro-ku, Tokyo 152, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, Tokyo Institute of Technology, O-okayama Meguro-ku, Tokyo 152, Japan","institution_ids":["https://openalex.org/I114531698"]},{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, Tokyo Institute of Technology, O-okayama, Meguro-ku, Tokyo 152, Japan","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089756558","display_name":"Shuichi Ueno","orcid":"https://orcid.org/0000-0002-2611-962X"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shuichi Ueno","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, Tokyo Institute of Technology, O-okayama Meguro-ku, Tokyo 152, Japan","Department of Electrical and Electronic Engineering, Tokyo Institute of Technology, O-okayama, Meguro-ku, Tokyo 152, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, Tokyo Institute of Technology, O-okayama Meguro-ku, Tokyo 152, Japan","institution_ids":["https://openalex.org/I114531698"]},{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, Tokyo Institute of Technology, O-okayama, Meguro-ku, Tokyo 152, Japan","institution_ids":["https://openalex.org/I114531698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114531698"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.9556,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.9371701,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"2","first_page":"181","last_page":"197"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8253580927848816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.636397659778595},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6141910552978516},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5690120458602905},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5297822952270508},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5068498253822327},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.47025027871131897},{"id":"https://openalex.org/keywords/edge-contraction","display_name":"Edge contraction","score":0.41651245951652527},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4127735495567322},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.280917763710022},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2559848427772522}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8253580927848816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.636397659778595},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6141910552978516},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5690120458602905},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5297822952270508},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5068498253822327},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.47025027871131897},{"id":"https://openalex.org/C204562854","wikidata":"https://www.wikidata.org/wiki/Q1397646","display_name":"Edge contraction","level":5,"score":0.41651245951652527},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4127735495567322},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.280917763710022},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2559848427772522}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230160207","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230160207","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W4234462414"],"related_works":["https://openalex.org/W1997206487","https://openalex.org/W3190612612","https://openalex.org/W938372727","https://openalex.org/W4313216298","https://openalex.org/W2071797893","https://openalex.org/W2097063382","https://openalex.org/W2058185550","https://openalex.org/W2025057636","https://openalex.org/W4233962493","https://openalex.org/W4379118151"],"abstract_inverted_index":{"Abstract":[0],"For":[1],"a":[2,24,67,96,105,119],"directed":[3,70,97],"graph":[4,100,103],"G":[5,65,77,94],",":[6,28],"let":[7],"d":[8,12,43,54],"+":[9,44],"(\u03bd)":[10,13,37,49],"and":[11,17,31,47],"be":[14],"the":[15,29,90],"outdegree":[16],"indegree":[18],"of":[19,109,122],"vertex":[20],"\u03bd,":[21],"respectively.":[22,58],"Given":[23],"positive":[25],"integer":[26],"k":[27,41,52,68,75],"outdeficiency":[30],"indeficiency":[32],"are":[33,85],"defined":[34],"by":[35,117],"\u03b4":[36,48,74],"=":[38,50,79],"max":[39],"(":[40,76],"\u2212":[42,53,55],"(\u03bd),":[45,56,81],"0)":[46],"max(":[51],"0),":[57],"It":[59],"is":[60,95,104,111,115],"evident":[61],"that":[62,92],"in":[63],"augmenting":[64],"to":[66],"\u2010edge\u2010connected":[69],"graph,":[71],"at":[72],"least":[73],")":[78],"max(\u03a3\u03b4":[80],"\u03a3\u03b4":[82],"(\u03bd))":[83],"edges":[84,110],"necessary.":[86],"This":[87],"paper":[88],"proves":[89],"theorem":[91],"if":[93],"tree":[98],"(directed":[99],"whose":[101],"underlying":[102],"tree)":[106],"this":[107],"number":[108],"enough.":[112],"The":[113],"proof":[114],"made":[116],"presenting":[118],"construction":[120],"procedure":[121],"polynomial\u2010order":[123],"complexity.":[124]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}