{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:06:33Z","timestamp":1760439993309},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8386,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,8]]},"DOI":"10.1016\/0166-218x(90)90116-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"183-186","source":"Crossref","is-referenced-by-count":20,"title":["A smallest augmentation to 3-connect a graph"],"prefix":"10.1016","volume":"28","author":[{"given":"Toshimasa","family":"Watanabe","sequence":"first","affiliation":[]},{"given":"Akira","family":"Nakamura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90116-T_BIB1","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","article-title":"Augmentation problems","volume":"2","author":"Eswaran","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90116-T_BIB2","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1109\/TCT.1970.1083185","article-title":"Connectivity considerations in the design of survivable networks","volume":"17","author":"Frank","year":"1970","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(90)90116-T_BIB3","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1137\/0210019","article-title":"Approximation algorithms for several graph augmentation problems","volume":"10","author":"Frederickson","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90116-T_BIB4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90116-T_BIB5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/0206003","article-title":"Smallest augmentations to biconnect a graph","volume":"6","author":"Rosenthal","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90116-T_BIB6","series-title":"Tech. Rept. C-18","article-title":"On a smallest augmentation to triconnect a graph","author":"Watanabe","year":"1983"},{"key":"10.1016\/0166-218X(90)90116-T_BIB7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","article-title":"Edge-connectivity augmentation problems","volume":"35","author":"Watanabe","year":"1987","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90116-T_BIB8","first-page":"1847","article-title":"3-Connectivity augmentation problems","author":"Watanabe","year":"1988","journal-title":"IEEE International Symposium on Circuits and Systems"},{"key":"10.1016\/0166-218X(90)90116-T_BIB9","unstructured":"T. Watanabe and A. Nakamura, A minimum 3-connectivity augmentation of a graph, to appear."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090116T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090116T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:19Z","timestamp":1555135039000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090116T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["0166218X9090116T"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90116-t","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}