{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:13:16Z","timestamp":1648998796453},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1987,5,1]],"date-time":"1987-05-01T00:00:00Z","timestamp":546825600000},"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":9574,"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":[[1987,5]]},"DOI":"10.1016\/0166-218x(87)90007-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"67-105","source":"Crossref","is-referenced-by-count":5,"title":["An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees"],"prefix":"10.1016","volume":"17","author":[{"given":"Toshimitsu","family":"Masuzawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken'ichi","family":"Hagihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuki","family":"Tokura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90007-2_BIB1","series-title":"Data Structures And Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0166-218X(87)90007-2_BIB2","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"issue":"4","key":"10.1016\/0166-218X(87)90007-2_BIB3","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","article-title":"Augmentation problems","volume":"5","author":"Eswaran","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(87)90007-2_BIB4","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"issue":"2","key":"10.1016\/0166-218X(87)90007-2_BIB5","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(87)90007-2_BIB6","series-title":"Computers and intractability \u2014 A Guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"10","key":"10.1016\/0166-218X(87)90007-2_BIB7","first-page":"1155","article-title":"Vulnerability of a communication network with a satellite","volume":"J67-D","author":"Hagihara","year":"1984","journal-title":"Trans. IECEJ"},{"key":"10.1016\/0166-218X(87)90007-2_BIB8","article-title":"The minimum augmentation of a directed tree to a k-edge-connected directed graph","volume":"CAS83-3","author":"Kajitani","year":"1983","journal-title":"Tech. Rep. IECEJ"},{"key":"10.1016\/0166-218X(87)90007-2_BIB9","article-title":"On the k-node-connectivity augmentation problem for undirected graphs","volume":"AL84-11","author":"Masuzawa","year":"1984","journal-title":"Tech. Rep. IECEJ"},{"key":"10.1016\/0166-218X(87)90007-2_BIB10","article-title":"On the k-node-connectivity augmentation problem for directed trees","volume":"AL84-27","author":"Masuzawa","year":"1984","journal-title":"Tech. Rep. IECEJ"},{"issue":"1","key":"10.1016\/0166-218X(87)90007-2_BIB11","first-page":"77","article-title":"The k-node-connectivity augmentation problem for directed binary trees","volume":"J67-D","author":"Masuzawa","year":"1984","journal-title":"Trans. IECEJ"},{"key":"10.1016\/0166-218X(87)90007-2_BIB12","article-title":"The graph classes with optimal algorithms for k-connectivity augmentation problems","author":"Masuzawa","year":"1984","journal-title":"Proc. Internat. Conf. on Computers, Systems and Signal Processing"},{"key":"10.1016\/0166-218X(87)90007-2_BIB13","unstructured":"T. Masuzawa, K. Hagihara, K. Wada and N. Tokura, The optimal time algorithm for the k-node-connectivity augmentation problem for directed ternary trees, Trans. IECEJ, J68-D (to appear) (in Japanese)."},{"key":"10.1016\/0166-218X(87)90007-2_BIB14","article-title":"The minimum augmentation of trees to k-edge-connected graphs","volume":"IN83-6","author":"Ueno","year":"1983","journal-title":"Tech. Rep. IECEJ"},{"key":"10.1016\/0166-218X(87)90007-2_BIB15","article-title":"Vertex-connectivity augmentation problems","volume":"AL81-26","author":"Watanabe","year":"1981","journal-title":"Tech. Rep. IECEJ"},{"key":"10.1016\/0166-218X(87)90007-2_BIB16","article-title":"k-edge-connectivity augmentation problem","volume":"AL83-90","author":"Watanabe","year":"1984","journal-title":"Tech. Rep. IECEJ"},{"key":"10.1016\/0166-218X(87)90007-2_BIB17","article-title":"Augmentation problem for a vertex subset of a graph","volume":"AL83-89","author":"Watanabe","year":"1984","journal-title":"Tech. Rep. IECEJ"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900072?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900072?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:53:12Z","timestamp":1555134792000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,5]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1987,5]]}},"alternative-id":["0166218X87900072"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90007-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,5]]}}}