{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T16:05:51Z","timestamp":1648742751820},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1007\/bf02074877","type":"journal-article","created":{"date-parts":[[2005,8,13]],"date-time":"2005-08-13T17:58:03Z","timestamp":1123955883000},"page":"403-412","source":"Crossref","is-referenced-by-count":2,"title":["The most vital edges with respect to the number of spanning trees in two-terminal series-parallel graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Rong-Hong","family":"Jan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lih-Hsing","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yueh-Ying","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02074877_CR1","first-page":"54","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, 54\u201355, Addison-Wesley, Reading, MA, 1974."},{"key":"BF02074877_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6377(89)90003-5","volume":"8","author":"M. O. Ball","year":"1989","unstructured":"M. O. Ball, B. L. Golden and R. V. Vohra,Finding the most vital arcs in a network, Operations Research Letters, 8, 73\u201376 (1989).","journal-title":"Operations Research Letters"},{"key":"BF02074877_CR3","first-page":"49","volume-title":"The Combinatorics of Network Reliability","author":"C. J. Colbourn","year":"1987","unstructured":"C. J. Colbourn,The Combinatorics of Network Reliability, 49\u201353, Oxford University Press, Oxford, England, 1987."},{"key":"BF02074877_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","volume":"1","author":"H. W. Corley","year":"1982","unstructured":"H. W. Corley and D. Y. Sha,Most vital links and nodes in weighted networks, Operations Research Letters, 1, 157\u2013160 (1982).","journal-title":"Operations Research Letters"},{"key":"BF02074877_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R. J. Duffin","year":"1965","unstructured":"R. J. Duffin,Topology of series-parallel networks, Journal of Mathematical Analysis and Applications, 10, 303\u2013318 (1965).","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"BF02074877_CR6","volume-title":"Graph Theory","author":"R. Gould","year":"1988","unstructured":"R. Gould,Graph Theory, Benjamin\/Cummings, Menlo Park, CA, 1988."},{"key":"BF02074877_CR7","first-page":"497","volume":"17","author":"S. H. Lubore","year":"1970","unstructured":"S. H. Lubore, H. D. Ratliff and G. T. Sicilia,Determining the most vital links in a flow network, Naval Research Logistics Quarterly, 17, 497\u2013502 (1970).","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02074877_CR8","doi-asserted-by":"crossref","unstructured":"H. D. Ratliff and A. S. Rosenthal,Order-picking in a rectangular warehouse: A solvable case of the traveling salesman problem, Operations Research, 507\u2013521 (1983).","DOI":"10.1287\/opre.31.3.507"},{"key":"BF02074877_CR9","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R. Tarjan, and E. L. Lawler,The recognition of series parallel digraphs, SIAM Journal on Computing, 11, 298\u2013313 (1982).","journal-title":"SIAM Journal on Computing"},{"key":"BF02074877_CR10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J. A. Wald","year":"1983","unstructured":"J. A. Wald and C. J. Colbourn,Steiner trees, partial 2-trees, and minimum IFI networks, Networks, 13, 159\u2013167 (1983).","journal-title":"Networks"},{"key":"BF02074877_CR11","unstructured":"Y. L. Wang, R. S. Chang and P. R. Chang,The tour problems in two-terminal series-parallel graphs, to appear in BIT."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02074877.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02074877\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02074877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T09:28:46Z","timestamp":1557826126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02074877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["BF02074877"],"URL":"https:\/\/doi.org\/10.1007\/bf02074877","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}