{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:52:54Z","timestamp":1725598374315},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226151"},{"type":"electronic","value":"9783642226168"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22616-8_9","type":"book-chapter","created":{"date-parts":[[2011,7,30]],"date-time":"2011-07-30T01:25:42Z","timestamp":1311989142000},"page":"98-112","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges"],"prefix":"10.1007","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1287\/opre.41.1.18","volume":"41","author":"M.O. Ball","year":"1993","unstructured":"Ball, M.O., Lin, F.L.: A Reliability Model Applied to Emergency Service Vehicle Location. Oper. Res.\u00a041(1), 18\u201336 (1993)","journal-title":"Oper. Res."},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/net.3230210306","volume":"21","author":"M.O. Ball","year":"1991","unstructured":"Ball, M.O., Provan, J.S., Shier, D.R.: Reliability Covering Problems. Networks\u00a021(3), 345\u2013357 (1991)","journal-title":"Networks"},{"key":"9_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Application","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Application. Macmillan, London (1976)"},{"issue":"6","key":"9_CR4","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/S0167-8191(00)00100-9","volume":"27","author":"Y. Censor","year":"2001","unstructured":"Censor, Y., Gordon, D., Gordon, R.: Component Averaging: an Efficient Iterative Parallel Algorithm for Large and Sparse Unstructured Problems. Parallel Computing\u00a027(6), 777\u2013808 (2001)","journal-title":"Parallel Computing"},{"key":"9_CR5","volume-title":"The Combinatorics of Network Reliability","author":"C.J. Colbourn","year":"1987","unstructured":"Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, New York (1987)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0304-3975(97)00124-2","volume":"209","author":"C.J. Colbourn","year":"1998","unstructured":"Colbourn, C.J., Xue, G.: A Linear Time Algorithms for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges. Theor. Comput. Sci.\u00a0209, 331\u2013345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Ding, W.: Computing the Most Reliable Source on Stochastic Ring Networks. In: 2009 WRI World Congress on Software Engineering, Xiamen, China, May 19\u201321, vol.\u00a01, pp. 345\u2013347 (2009)","DOI":"10.1109\/WCSE.2009.31"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Ding, W.: Embedded-Rings-Based Survivable Networks. In: 2010 International Conference on Industrial and Information Systems, Dalian, China, July 10\u201311, vol.\u00a02, pp. 412\u2013415 (2010)","DOI":"10.1109\/INDUSIS.2010.5565740"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-17461-2_22","volume-title":"Combinatorial Optimization and Applications","author":"W. Ding","year":"2010","unstructured":"Ding, W., Xue, G.: A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol.\u00a06509, pp. 268\u2013280. Springer, Heidelberg (2010)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.tcs.2009.08.003","volume":"412","author":"W. Ding","year":"2011","unstructured":"Ding, W., Xue, G.: A Linear Time Algorithm for Computing a Most Reliable Source on a Tree Network with Faulty Nodes. Theor. Comput. Sci.\u00a0412, 225\u2013232 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230220303","volume":"22","author":"H.A. Eiselt","year":"1992","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Location of Facilities on a Network Subject to a Single-Edge Failure. Networks\u00a022(3), 231\u2013246 (1992)","journal-title":"Networks"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. In: Proceedings of the seventeenth annual ACM symposium on Theory of computing (STOC 1985), Toronto, Canada, pp. 1\u201310 (1985)","DOI":"10.1145\/22145.22146"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<219::AID-NET7>3.0.CO;2-L","volume":"27","author":"E. Melachrinoudis","year":"1996","unstructured":"Melachrinoudis, E., Helander, M.E.: A Single Facility Location Problem on a Tree with Unreliable Edges. Networks\u00a027(3), 219\u2013237 (1996)","journal-title":"Networks"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1287\/trsc.13.2.85","volume":"13","author":"P.B. Mirchandani","year":"1979","unstructured":"Mirchandani, P.B., Odoni, A.R.: Locations of Medians on Stochastic Networks. Transport. Sci.\u00a013, 85\u201397 (1979)","journal-title":"Transport. Sci."},{"key":"9_CR15","first-page":"363","volume":"28","author":"L.D. Nel","year":"1990","unstructured":"Nel, L.D., Colbourn, C.J.: Locating a Broadcast Facility in an Unreliable Network. INFOR\u00a028, 363\u2013379 (1990)","journal-title":"INFOR"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0027124","volume-title":"Solving Combinatorial Optimization Problems in Parallel Methods and Techniques","author":"P.M. Pardalos","year":"1996","unstructured":"Pardalos, P.M., Xue, G., Panagiotopoulos, P.D.: Parallel Algorithms for Global Optimization Problems. In: Ferreira, A., Pardalos, P.M. (eds.) SCOOP 1995. LNCS, vol.\u00a01054, pp. 232\u2013247. Springer, Heidelberg (1996)"},{"key":"9_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198533863.001.0001","volume-title":"Network Reliability and Algebraic Structure","author":"D.R. Shier","year":"1991","unstructured":"Shier, D.R.: Network Reliability and Algebraic Structure. Oxford University Press, New York (1991)"},{"issue":"6","key":"9_CR18","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/71.285606","volume":"5","author":"X.H. Sun","year":"1994","unstructured":"Sun, X.H., Rover, D.T.: Scalability of Parallel Algorithm-Machine Combinations. IEEE Transactions on Parallel and Distributed Systtem\u00a05(6), 599\u2013613 (1994)","journal-title":"IEEE Transactions on Parallel and Distributed Systtem"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/(SICI)1097-0037(199708)30:1<37::AID-NET5>3.0.CO;2-M","volume":"30","author":"G. Xue","year":"1997","unstructured":"Xue, G.: Linear Time Algorithms for Computing the Most Reliable Source on an Unreliable Tree Network. Networks\u00a030(1), 37\u201345 (1997)","journal-title":"Networks"},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/357994.358023","volume":"27","author":"T.Y. Zhang","year":"1984","unstructured":"Zhang, T.Y., Suen, C.Y.: A Fast Parallel Algorithm for Thinning Digital Patterns. Communications of the ACM\u00a027(3), 236\u2013239 (1984)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22616-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T11:35:58Z","timestamp":1712662558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22616-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226151","9783642226168"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22616-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}