{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T03:17:32Z","timestamp":1648523852744},"reference-count":26,"publisher":"Elsevier BV","issue":"31-33","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,6,28]],"date-time":"2014-06-28T00:00:00Z","timestamp":1403913600000},"content-version":"vor","delay-in-days":1488,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1016\/j.tcs.2010.04.019","type":"journal-article","created":{"date-parts":[[2010,4,17]],"date-time":"2010-04-17T10:16:58Z","timestamp":1271499418000},"page":"2878-2889","source":"Crossref","is-referenced-by-count":4,"title":["The bridge-connectivity augmentation problem with a partition constraint"],"prefix":"10.1016","volume":"411","author":[{"given":"Yen-Chiu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Hsin-Wen","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Pei-Chi","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Wei-Kuan","family":"Shih","sequence":"additional","affiliation":[]},{"given":"Tsan-sheng","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2010.04.019_b1","series-title":"Mathematical Programming: State of the Art 1994","first-page":"34","article-title":"Connectivity augmentation problems in network design","author":"Frank","year":"1994"},{"key":"10.1016\/j.tcs.2010.04.019_b2","unstructured":"T.-s. Hsu, Graph augmentation and related problems: theory and practice, Ph.D. thesis, University of Texas at Austin, TX, USA, 1993."},{"issue":"3","key":"10.1016\/j.tcs.2010.04.019_b3","first-page":"372","article-title":"Recent development of graph connectivity augmentation algorithms","volume":"83","author":"Nagamochi","year":"2000","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"2","key":"10.1016\/j.tcs.2010.04.019_b4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/S0895480196303216","article-title":"Optimal augmentation for bipartite componentwise biconnectivity in linear time","volume":"19","author":"Hsu","year":"2005","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"10.1016\/j.tcs.2010.04.019_b5","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1137\/S0895480197324700","article-title":"Edge-connectivity augmentation with partition constraints","volume":"12","author":"Bang-Jensen","year":"1999","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"10.1016\/j.tcs.2010.04.019_b6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0020-0190(94)00229-R","article-title":"Linear-time optimal augmentation for componentwise bipartite-completeness of graphs","volume":"54","author":"Kao","year":"1995","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/j.tcs.2010.04.019_b7","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1145\/76894.76895","article-title":"Security-control methods for statistical databases: a comparative study","volume":"21","author":"Adam","year":"1989","journal-title":"ACM Computing Surveys"},{"issue":"6","key":"10.1016\/j.tcs.2010.04.019_b8","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1109\/TSE.1982.236161","article-title":"Auditing and inference control in statistical databases","volume":"8","author":"Chin","year":"1982","journal-title":"IEEE Transactions Software Engineering"},{"issue":"370","key":"10.1016\/j.tcs.2010.04.019_b9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1080\/01621459.1980.10477481","article-title":"Suppression methodology and statistical disclosure control","volume":"75","author":"Cox","year":"1980","journal-title":"Journal of the American Statistical Association"},{"key":"10.1016\/j.tcs.2010.04.019_b10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/MC.1983.1654444","article-title":"Inference controls for statistical databases","volume":"16","author":"Denning","year":"1983","journal-title":"IEEE Computer"},{"issue":"4","key":"10.1016\/j.tcs.2010.04.019_b11","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1002\/net.3230220407","article-title":"Cell suppression: disclosure protection for sensitive tabular data","volume":"22","author":"Kelly","year":"1992","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.tcs.2010.04.019_b12","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1137\/0217034","article-title":"A graph theoretic approach to statistical data security","volume":"17","author":"Gusfield","year":"1988","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10.1016\/j.tcs.2010.04.019_b13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/S0895480193243274","article-title":"Data security equals graph connectivity","volume":"9","author":"Kao","year":"1996","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"10.1016\/j.tcs.2010.04.019_b14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/S0097539793253589","article-title":"Total protection of analytic-invariant information in cross-tabulated tables","volume":"26","author":"Kao","year":"1997","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.tcs.2010.04.019_b15","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","article-title":"Augmentation problems","volume":"5","author":"Eswaran","year":"1976","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10.1016\/j.tcs.2010.04.019_b16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0196-6774(02)00223-7","article-title":"Simpler and faster biconnectivity augmentation","volume":"45","author":"Hsu","year":"2002","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.tcs.2010.04.019_b17","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 Journal on Computing"},{"issue":"1","key":"10.1016\/j.tcs.2010.04.019_b18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0022-0000(93)90050-7","article-title":"A minimum 3-connectivity augmentation of a graph","volume":"46","author":"Watanabe","year":"1993","journal-title":"Journal of Computer and System Science"},{"key":"10.1016\/j.tcs.2010.04.019_b19","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1006\/jagm.2000.1077","article-title":"On four-connecting a triconnected graph","volume":"2","author":"Hsu","year":"2000","journal-title":"Journal of Algorithm 35"},{"issue":"3","key":"10.1016\/j.tcs.2010.04.019_b20","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00453-007-9127-1","article-title":"Smallest bipartite bridge-connectivity augmentation","volume":"54","author":"Huang","year":"2009","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2010.04.019_b21","doi-asserted-by":"crossref","unstructured":"F. Harary, Graph Theory, in: Addison-Wesley Series in Mathematics, Reading, 1969.","DOI":"10.21236\/AD0705364"},{"issue":"2","key":"10.1016\/j.tcs.2010.04.019_b22","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/375827.375847","article-title":"Concurrent threads and optimal parallel minimum spanning trees algorithm","volume":"48","author":"Chong","year":"2001","journal-title":"Journal of the ACM"},{"issue":"1","key":"10.1016\/j.tcs.2010.04.019_b23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90019-X","article-title":"Approximate parallel scheduling. Part II: Applications to logarithmic-time optimal graph algorithms","volume":"92","author":"Cole","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2010.04.019_b24","series-title":"Synthesis of Parallel Algorithms","first-page":"275","article-title":"Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity","author":"Ramachandran","year":"1993"},{"key":"10.1016\/j.tcs.2010.04.019_b25","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"10.1016\/j.tcs.2010.04.019_b26","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM Journal on Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397510002148?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397510002148?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T13:23:13Z","timestamp":1559049793000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397510002148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":26,"journal-issue":{"issue":"31-33","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["S0304397510002148"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.tcs.2010.04.019","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}
