{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:06:33Z","timestamp":1777539993178,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,5,21]],"date-time":"2008-05-21T00:00:00Z","timestamp":1211328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s10878-008-9160-2","type":"journal-article","created":{"date-parts":[[2008,5,20]],"date-time":"2008-05-20T17:06:33Z","timestamp":1211303193000},"page":"307-322","source":"Crossref","is-referenced-by-count":31,"title":["On broadcasting in unicyclic graphs"],"prefix":"10.1007","volume":"16","author":[{"given":"Hovhannes A.","family":"Harutyunyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward","family":"Maraachlian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,21]]},"reference":[{"key":"9160_CR1","doi-asserted-by":"crossref","unstructured":"Aiello W, Chung F, Lu L (2001) Random evolution in massive graphs. In: Proceedings of the 42nd annual IEEE symposium on foundations of computer science, FOCS\u201901, pp\u00a0510\u2013519","DOI":"10.1109\/SFCS.2001.959927"},{"key":"9160_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Noy A, Guha S, Naor J, Schieber B (1998) Multicasting in heterogeneous networks. In: Proceedings of ACM symposium on theory of computing, STOC\u201998, pp\u00a018\u201336","DOI":"10.1145\/276698.276857"},{"key":"9160_CR3","unstructured":"Beier R, Sibeyn JF (2000) A powerful heuristic for telephone gossiping. In: Proceedings of the 7th international colloquium on structural information & communication complexity, SIROCCO\u201900, L\u2019Aquila, Italy, pp\u00a017\u201336"},{"key":"9160_CR4","unstructured":"Doar MB (1996) A better model for generating test networks (1996) In: IEEE GLOBECOM\u201996, London, UK, pp\u00a0152\u2013158"},{"key":"9160_CR5","doi-asserted-by":"crossref","unstructured":"Elkin M, Kortsarz G (2002) A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. In: Proceedings of ACM Symposium on Theory of Computing, STOC\u201902, pp\u00a0438\u2013447","DOI":"10.1145\/509907.509972"},{"key":"9160_CR6","unstructured":"Elkin M, Kortsarz G (2003) Sublogarithmic approximation for telephone multicast: path out of jungle. In: Proceedings of symposium on discrete algorithms, SODA\u201903, Baltimore, MD, pp\u00a076\u201385"},{"key":"9160_CR7","doi-asserted-by":"crossref","unstructured":"Feige U, Peleg D, Raghavan P, Upfal E (1990) Randomized broadcast in networks. In: Proceedings of international symposium on algorithms, SIGAL\u201990, pp\u00a0128\u2013137","DOI":"10.1007\/3-540-52921-7_62"},{"key":"9160_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P Fraigniaud","year":"1994","unstructured":"Fraigniaud P, Lazard E (1994) Methods and problems of communication in usual networks. Discrete Appl Math 53:79\u2013133","journal-title":"Discrete Appl Math"},{"issue":"1","key":"9160_CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1006\/jpdc.1997.1318","volume":"43","author":"P Fraigniaud","year":"1997","unstructured":"Fraigniaud P, Vial S (1997a) Approximation algorithms for broadcasting and gossiping. J Parallel Distributed Comput 43(1):47\u201355","journal-title":"J Parallel Distributed Comput"},{"key":"9160_CR10","unstructured":"Fraigniaud P, Vial S (1997b) Heuristic algorithms for personalized communication problems in point-to-point networks. In: Proceedings of the 4th colloquium on structural information and communication complexity, SIROCCO\u201997, pp\u00a0240\u2013252"},{"issue":"1","key":"9160_CR11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1142\/S0129626499000049","volume":"9","author":"P Fraigniaud","year":"1999","unstructured":"Fraigniaud P, Vial S (1999) Comparison of heuristics for one-to-all and all-to-all communication in partial meshes. Parallel Process Lett 9(1):9\u201320","journal-title":"Parallel Process Lett"},{"key":"9160_CR12","unstructured":"Harutyunyan HA, Maraachlian E (2007) Linear algorithm for broadcasting in unicyclic graphs. In: Proceedings of 13th annual COCOON, Banff, Canada, pp\u00a0372\u2013383"},{"issue":"1","key":"9160_CR13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.jpdc.2005.06.010","volume":"66","author":"HA Harutyunyan","year":"2006","unstructured":"Harutyunyan HA, Shao B (2006) An efficient heuristic for broadcasting in networks. J Parallel Distributed Comput 66(1):68\u201376","journal-title":"J Parallel Distributed Comput"},{"key":"9160_CR14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"SM Hedetniemi","year":"1988","unstructured":"Hedetniemi SM, Hedetniemi ST, Liestman AL (1988) A survey of gossiping and broadcasting in communication networks. Networks 18:319\u2013349","journal-title":"Networks"},{"key":"9160_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-1-4757-2491-2_5","volume-title":"Combinatorial network theory","author":"J Hromkovic","year":"1996","unstructured":"Hromkovic J, Klasing R, Monien B, Peine R (1996) Dissemination of information in interconnection networks. In: Du D-Z, Hsu DF (eds) Combinatorial network theory. Kluwer Academic, Dordrecht, pp\u00a0125\u2013212"},{"key":"9160_CR16","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"D Johnson","year":"1979","unstructured":"Johnson D, Garey M (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9160_CR17","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0895480193245923","volume":"8","author":"G Kortsarz","year":"1995","unstructured":"Kortsarz G, Peleg D (1995) Approximation algorithms for minimum time broadcast. SIAM J Discrete Math 8:401\u2013427","journal-title":"SIAM J Discrete Math"},{"key":"9160_CR18","doi-asserted-by":"crossref","unstructured":"Ravi R (1994) Rapid rumor ramification: Approximating the minimum broadcast time. In: Proceedings of 35th symposium on foundation of computer science, FOCS\u201994, pp\u00a0202\u2013213","DOI":"10.1109\/SFCS.1994.365693"},{"issue":"4","key":"9160_CR19","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"PJ Slater","year":"1981","unstructured":"Slater PJ, Cockayne EJ, Hedetniemi ST (1981) Information dissemination in trees. SIAM J Comput 10(4):692\u2013701","journal-title":"SIAM J Comput"},{"issue":"9","key":"9160_CR20","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1109\/TC.1984.1676496","volume":"33","author":"P Scheuerman","year":"1984","unstructured":"Scheuerman P, Wu G (1984) Heuristic algorithms for broadcasting in point-to-point computer network. IEEE Trans Comput C 33(9):804\u2013811","journal-title":"IEEE Trans Comput C"},{"key":"9160_CR21","doi-asserted-by":"crossref","unstructured":"Zegura EW, Calvert K, Bhattacharjee S (1996) How to model an internetwork. In: Proceedings of the IEEE conference on computer communications, INFOCOM\u201996, San Francisco, CA, pp\u00a0804\u2013814","DOI":"10.1109\/INFCOM.1996.493353"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9160-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9160-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9160-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:13Z","timestamp":1559276293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9160-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,21]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9160"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9160-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,21]]}}}