{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T10:52:13Z","timestamp":1689850333874},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2002,3]]},"abstract":"<jats:p> We consider a broadcasting problem in the n-dimensional k-ary even torus in the shouting communication mode, i.e. any node of a network can inform all its neighbours in one time step. In addition, during any time step a number of links of the network can be faulty. Moreover the faults are dynamic. The problem is to determine the minimum broadcasting time if at most 2n - 1 faults are allowed in any step. In [4], it was shown that the broadcasting time is at most diameter+O(1), provided that k is limited by a polynomial of n. In our paper we drop this additional assumption and prove that the broadcasting can be always done in time diameter +2. The bound is the best possible. <\/jats:p>","DOI":"10.1142\/s0129626402000781","type":"journal-article","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T13:07:47Z","timestamp":1346504867000},"page":"17-22","source":"Crossref","is-referenced-by-count":6,"title":["OPTIMAL BROADCASTING IN TORI WITH DYNAMIC FAULTS"],"prefix":"10.1142","volume":"12","author":[{"given":"S.","family":"DOBREV","sequence":"first","affiliation":[{"name":"Department of Informatics, Institute of Mathematics, Slovak Academy of Sciences, D\u00fabravsk\u00e1 9, 842 35 Bratislava, Slovak Republic"}]},{"given":"I.","family":"VRTO","sequence":"additional","affiliation":[{"name":"Department of Informatics, Institute of Mathematics, Slovak Academy of Sciences, D\u00fabravsk\u00e1 9, 842 35 Bratislava, Slovak Republic"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403004"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00074-X"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626400000068"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00093-9"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90180-5"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90105-Q"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180406"},{"key":"p_9","first-page":"125","author":"Hromkovic R.","year":"1995","journal-title":"Dordrecht"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N"},{"key":"p_11","first-page":"358","author":"Santoro P","year":"1990","journal-title":"Berlin"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626402000781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:19:45Z","timestamp":1565108385000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626402000781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":10,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2002,3]]}},"alternative-id":["10.1142\/S0129626402000781"],"URL":"https:\/\/doi.org\/10.1142\/s0129626402000781","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}