{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:18:35Z","timestamp":1778300315215,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671596","type":"print"},{"value":"9783540465218","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_2","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T18:47:16Z","timestamp":1194115636000},"page":"17-31","source":"Crossref","is-referenced-by-count":28,"title":["Computing a Diameter-Constrained Minimum Spanning Tree in Parallel"],"prefix":"10.1007","author":[{"given":"Narsingh","family":"Deo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayman","family":"Abdalla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"2_CR1","unstructured":"Abdalla, A., Deo, N., Fraceschini, R.: Parallel heuristics for the diameter-constrained MST problem. Congressus Numerantium, (1999) (to appear)"},{"key":"2_CR2","first-page":"131","volume":"126","author":"A. Abdalla","year":"1997","unstructured":"Abdalla, A., Deo, N., Kumar, N., Terry, T.: Parallel computation of a diameter-constrained MST and related problems. Congressus Numerantium, Vol. 126. (1997) 131\u2013155","journal-title":"Congressus Numerantium"},{"key":"2_CR3","unstructured":"Achuthan, N.R., Caccetta, L., Caccetta, P., Geelen, J.F: Algorithms for the minimum weight spanning tree with bounded diameter problem. Optimization: Techniques and Applications, (1992) 297\u2013304"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1109\/INFCOM.1993.253399","volume":"3","author":"K. Bala","year":"1993","unstructured":"Bala, K., Petropoulos, K., Stern, T.E.: Multicasting in a Linear Lightwave Network. IEEE INFOCOM\u2019 93, Vol. 3. (1993) 1350\u20131358","journal-title":"IEEE INFOCOM\u2019 93"},{"key":"2_CR5","volume-title":"Distributed Operating Systems and Algorithms","author":"R. Chow","year":"1997","unstructured":"Chow, R., Johnson, T.: Distributed Operating Systems and Algorithms. Addison-Wesley, Reading, MA (1997)"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1090\/dimacs\/040\/13","volume":"40","author":"N. Deo","year":"1998","unstructured":"Deo N., Kumar, K.: Constrained Spanning Tree Problems: Approximate Methods and Parallel Computation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 40. (1998) 191\u2013217","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"2_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/dimacs\/015\/09","volume":"15","author":"B.M.E. Moret","year":"1994","unstructured":"Moret, B.M.E., Shapiro, H.D.: An empirical analysis of algorithms for constructing a minimum spanning tree. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 15. (1994) 99\u2013117","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"2_CR9","volume-title":"Bounded Diameter Minimum Spanning Tree Problem","author":"P.W. Paddock","year":"1984","unstructured":"P.W. Paddock.: Bounded Diameter Minimum Spanning Tree Problem, M.S. Thesis, George Mason University, Fairfax, VA (1984)"},{"key":"2_CR10","volume-title":"Graph Evolution: An Introduction to the Theory of Random Graphs","author":"E.M. Palmer","year":"1985","unstructured":"Palmer., E.M.: Graph Evolution: An Introduction to the Theory of Random Graphs, John-Wiley & Sons, Inc., New York (1985)"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, Vol. 7. No. 1. (1989) 61\u201377","journal-title":"ACM Transactions on Computer Systems"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(92)90219-L","volume":"43","author":"R. Satyanarayanan","year":"1992","unstructured":"Satyanarayanan, R., Muthukrishnan, D.R.: A note on Raymond\u2019s tree-based algorithm for distributed mutual exclusion. Information Processing Letters, Vol. 43. (1992) 249\u2013255","journal-title":"Information Processing Letters"},{"issue":"2","key":"2_CR13","first-page":"21","volume":"24","author":"R. Satyanarayanan","year":"1994","unstructured":"Satyanarayanan, R., Muthukrishnan, D.R.: A static-tree-based algorithm for the distributed readers and writers problem. Computer Science and Informatics, Vol. 24. No.2. (1994) 21\u201332","journal-title":"Computer Science and Informatics"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Wang, S, Lang, S.D.: A tree-based distributed algorithm for the k-entry critical section problem. In: Proceedings of the 1994 International Conference on Parallel and Distributed Systems, (1994) 592\u2013597","DOI":"10.1109\/ICPADS.1994.590400"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T18:23:06Z","timestamp":1551032586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}