{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T04:41:56Z","timestamp":1744605716308},"reference-count":2,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1999,9]]},"abstract":"<jats:p> Edge reductions model the ability of speeding up communication between processors in a network. In this paper we consider performing edge reductions in a tree network so that the diameter of the tree is minimized. The diameter is directly related to the time needed to broadcast a message. In particular, for non-blocking message communication ignoring start-up costs, the diameter corresponds to the broadcasting time. For an n-vertex tree T and a quantity B, we present an O(n) time algorithm to determine edge reductions such that the resulting tree has diameter at most B and the cost of the reduction is a minimum (over all reductions resulting in a diameter of at most B). <\/jats:p>","DOI":"10.1142\/s0129626499000335","type":"journal-article","created":{"date-parts":[[2003,2,26]],"date-time":"2003-02-26T05:09:39Z","timestamp":1046236179000},"page":"361-371","source":"Crossref","is-referenced-by-count":3,"title":["MINIMIZING THE DIAMETER IN TREE NETWORKS UNDER EDGE REDUCTIONS"],"prefix":"10.1142","volume":"09","author":[{"given":"SUSANNE E.","family":"HAMBRUSCH","sequence":"first","affiliation":[{"name":"Department of Computer Sciences, Purdue  University, West Lafayette, IN 47907, USA"}]},{"given":"HYEONG-SEOK","family":"LIM","sequence":"additional","affiliation":[{"name":"Department of Computer Science,  Chonnam National University, Kwangju, 500-757, Korea"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90180-5"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0856"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626499000335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:19:11Z","timestamp":1565093951000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626499000335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":2,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1999,9]]}},"alternative-id":["10.1142\/S0129626499000335"],"URL":"https:\/\/doi.org\/10.1142\/s0129626499000335","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}