{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:31:33Z","timestamp":1648981893465},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":9329,"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":[[1988]]},"DOI":"10.1016\/0166-218x(88)90092-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"181-189","source":"Crossref","is-referenced-by-count":1,"title":["Acyclic k-connected subgraphs for distributed alternate routing in communications networks"],"prefix":"10.1016","volume":"22","author":[{"given":"Moshe","family":"Segal","sequence":"first","affiliation":[]},{"given":"Donald M.","family":"Topkis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90092-3_BIB1","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1002\/j.1538-7305.1981.tb00297.x","article-title":"Design and optimization of networks with dynamic routing","volume":"60","author":"Ash","year":"1981","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0166-218X(88)90092-3_BIB2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0204034","article-title":"An algorithm for determining whether the connectivity of a graph is at least k","volume":"4","author":"Even","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90092-3_BIB3","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","article-title":"Network flow and testing graph connectivity","volume":"4","author":"Even","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90092-3_BIB4","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(88)90092-3_BIB5","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TCOM.1969.1090115","article-title":"Route control in AUTOVON electronic switching centers","volume":"17","author":"Greene","year":"1969","journal-title":"IEEE Trans. Commun. Tech."},{"key":"10.1016\/0166-218X(88)90092-3_BIB6","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","article-title":"Efficient algorithms for graph manipulation","volume":"16","author":"Hopcroft","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(88)90092-3_BIB7","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(88)90092-3_BIB8","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1109\/TCT.1969.1082941","article-title":"Methods for investigating connectivity of large graphs","volume":"16","author":"Kleitman","year":"1969","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(88)90092-3_BIB9","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(88)90092-3_BIB10","first-page":"81","article-title":"Adaptive loop-free routing technique in store-and-forward communication networks","volume":"1","author":"Nishigaki","year":"1978","journal-title":"J. Inform. Process"},{"key":"10.1016\/0166-218X(88)90092-3_BIB11","series-title":"Engineering and operations in the Bell system","year":"1983"},{"key":"10.1016\/0166-218X(88)90092-3_BIB12","article-title":"Traffic engineering of communications networks with a general class of routing schemes","author":"Segal","year":"1964","journal-title":"Proceedings Fourth International Teletraffic Congress"},{"key":"10.1016\/0166-218X(88)90092-3_BIB13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","article-title":"Disjoint paths in a network","volume":"4","author":"Suurballe","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0166-218X(88)90092-3_BIB14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","article-title":"A quick method for finding shortest pairs of disjoint paths","volume":"14","author":"Suurballe","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0166-218X(88)90092-3_BIB15","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 J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900923?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900923?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:55:04Z","timestamp":1555134904000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88900923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988]]}},"alternative-id":["0166218X88900923"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90092-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988]]}}}