{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:54:30Z","timestamp":1648929270289},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":7137,"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":[[1994,1]]},"DOI":"10.1016\/0166-218x(92)00123-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"147-161","source":"Crossref","is-referenced-by-count":1,"title":["Cutting numbers for the forward loop backward hop network"],"prefix":"10.1016","volume":"48","author":[{"given":"X.D.","family":"Hu","sequence":"first","affiliation":[]},{"given":"F.K.","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)00123-4_BIB1","first-page":"29","article-title":"Pair-connected reliability of a tree and its distance degree sequence","volume":"58","author":"Amin","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(92)00123-4_BIB2","first-page":"43","article-title":"Exact formulas for reliability measure for various classes of graphs","volume":"58","author":"Amin","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(92)00123-4_BIB3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/net.3230210307","article-title":"On the nonexistence of uniformly optimal graphs for pair-connected reliability","volume":"21","author":"Amin","year":"1991","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)00123-4_BIB4","doi-asserted-by":"crossref","unstructured":"A.T. Amin, K.T. Siegrist and P.J. Slater, On the expected number of pairs of connected nodes: pair-connected reliability, Comput. Math. Appl., to appear.","DOI":"10.1016\/0895-7177(93)90245-T"},{"key":"10.1016\/0166-218X(92)00123-4_BIB5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1109\/TR.1986.4335425","article-title":"Maximizing the mean number of communicating vertex pairs in series-parallel networks","volume":"35","author":"Clark","year":"1986","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0166-218X(92)00123-4_BIB6","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1137\/0608033","article-title":"Network resilience","volume":"8","author":"Colbourn","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)00123-4_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0895-7177(93)90251-S","article-title":"Analysis and synthesis problems for network resilience","volume":"17","author":"Colbourn","year":"1993","journal-title":"Math. Comput. Modelling"},{"key":"10.1016\/0166-218X(92)00123-4_BIB8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TCOM.1964.1088950","article-title":"On the survivability of communication systems","volume":"24","author":"Deo","year":"1964","journal-title":"IEEE Trans. Comm. Systems"},{"key":"10.1016\/0166-218X(92)00123-4_BIB9","first-page":"319","article-title":"A highly reliable, distributed loop network structure","author":"Grnarov","year":"1980","journal-title":"Proceedings International Symposium on Fault Tolerant Computing"},{"key":"10.1016\/0166-218X(92)00123-4_BIB10","series-title":"Combinatorial Structures and Their Application","first-page":"147","article-title":"How cutting is a cutpoint?","author":"Harary","year":"1970"},{"key":"10.1016\/0166-218X(92)00123-4_BIB11","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(71)90003-3","article-title":"The cutting center theorem for trees","volume":"1","author":"Harary","year":"1971","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)00123-4_BIB12","doi-asserted-by":"crossref","unstructured":"F. Harary and P.J. Slater, A linear algorithm for the cutting center of a tree, Inform. Process. Lett., to appear.","DOI":"10.1016\/0020-0190(86)90093-1"},{"key":"10.1016\/0166-218X(92)00123-4_BIB13","first-page":"500.3.1","article-title":"Survival reliabilities of double loop networks","author":"Hu","year":"1990","journal-title":"IEEE Global Telecommunication Conference"},{"key":"10.1016\/0166-218X(92)00123-4_BIB14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1017\/S0269964800002072","article-title":"Reliabilities of double loop networks","volume":"5","author":"Hwang","year":"1991","journal-title":"Probab. Engrg. Inform. Sci."},{"key":"10.1016\/0166-218X(92)00123-4_BIB15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(87)90123-3","article-title":"Double loop networks with minimum delay","volume":"66","author":"Hwang","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)00123-4_BIB16","first-page":"163","article-title":"Distributed loop computer networks","volume":"17","author":"Liu","year":"1978"},{"key":"10.1016\/0166-218X(92)00123-4_BIB17","first-page":"597","article-title":"Fault-tolerant ability to double-node failures in double-loop computer networks","author":"Masuyama","year":"1986","journal-title":"Trans. IECE Japan"},{"key":"10.1016\/0166-218X(92)00123-4_BIB18","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1109\/12.24275","article-title":"Tolerance of double-loop computer network to multinode failures","author":"Masuyama","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)00123-4_BIB19","first-page":"107","article-title":"Resilience of partial k-tree networks","volume":"74","author":"Mata-Montero","year":"1989","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(92)00123-4_BIB20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1002\/net.3230210305","article-title":"Resilience of partial k-tree networks with edge and node failures","volume":"21","author":"Mata-Montero","year":"1991","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)00123-4_BIB21","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TC.1985.1676514","article-title":"Reliable loop topologies for large local computer networks","volume":"34","author":"Raghavendra","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)00123-4_BIB22","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1147\/rd.335.0511","article-title":"Dependability evaluation of a class of multi-loop topology for local area networks","volume":"33","author":"Smith","year":"1989","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0166-218X(92)00123-4_BIB23","first-page":"279","article-title":"Network reliability analysis I","volume":"2","author":"Van Slyke","year":"1972","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92001234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92001234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:51:26Z","timestamp":1555116686000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92001234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0166218X92001234"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)00123-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}