Janzer, Barnabás; Johnson, J. Robert; Leader, Imre Partial shuffles by lazy swaps. (English) Zbl 1526.05003 SIAM J. Discrete Math. 37, No. 4, 2544-2557 (2023). MSC: 05A05 60C05 05D99 PDFBibTeX XMLCite \textit{B. Janzer} et al., SIAM J. Discrete Math. 37, No. 4, 2544--2557 (2023; Zbl 1526.05003) Full Text: DOI arXiv
Willie Wong, H. W.; Tay, E. G. Optimal orientations of vertex-multiplications of Cartesian products of graphs. (English) Zbl 1497.05235 Australas. J. Comb. 83, Part 1, 109-128 (2022). Reviewer: Thanin Sitthiwirattham (Bangkok) MSC: 05C76 05C75 PDFBibTeX XMLCite \textit{H. W. Willie Wong} and \textit{E. G. Tay}, Australas. J. Comb. 83, Part 1, 109--128 (2022; Zbl 1497.05235) Full Text: arXiv Link
Cooper, Martin C.; Herzig, Andreas; Maffre, Faustine; Maris, Frédéric; Perrotin, Elise; Régnier, Pierre A lightweight epistemic logic and its application to planning. (English) Zbl 1520.68184 Artif. Intell. 298, Article ID 103437, 32 p. (2021). MSC: 68T27 03B42 68Q17 68T20 PDFBibTeX XMLCite \textit{M. C. Cooper} et al., Artif. Intell. 298, Article ID 103437, 32 p. (2021; Zbl 1520.68184) Full Text: DOI HAL
van Ditmarsch, Hans; van der Hoek, Wiebe; Kuijer, Louwe B. The logic of gossiping. (English) Zbl 1493.68346 Artif. Intell. 286, Article ID 103306, 26 p. (2020). MSC: 68T27 03B42 68Q60 PDFBibTeX XMLCite \textit{H. van Ditmarsch} et al., Artif. Intell. 286, Article ID 103306, 26 p. (2020; Zbl 1493.68346) Full Text: DOI HAL
Ravi, R.; Rudenko, Oleksandr Multicommodity multicast, wireless and fast. (English) Zbl 07525515 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 78, 20 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{R. Ravi} and \textit{O. Rudenko}, LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 78, 20 p. (2019; Zbl 07525515) Full Text: DOI
van Ditmarsch, Hans; van Eijck, Jan; Pardo, Pere; Ramezanian, Rahim; Schwarzentruber, François Dynamic gossip. (English) Zbl 1421.68004 Bull. Iran. Math. Soc. 45, No. 3, 701-728 (2019). MSC: 68M12 68M14 68R10 PDFBibTeX XMLCite \textit{H. van Ditmarsch} et al., Bull. Iran. Math. Soc. 45, No. 3, 701--728 (2019; Zbl 1421.68004) Full Text: DOI arXiv
Cooper, Martin C.; Herzig, Andreas; Maffre, Faustine; Maris, Frédéric; Régnier, Pierre The epistemic gossip problem. (English) Zbl 1486.68189 Discrete Math. 342, No. 3, 654-663 (2019). MSC: 68T42 03B42 68M12 68R10 PDFBibTeX XMLCite \textit{M. C. Cooper} et al., Discrete Math. 342, No. 3, 654--663 (2019; Zbl 1486.68189) Full Text: DOI Link
Herzig, Andreas; Lorini, Emiliano; Maffre, Faustine Possible worlds semantics based on observation and communication. (English) Zbl 1437.03066 van Ditmarsch, Hans (ed.) et al., Jaakko Hintikka on knowledge and game-theoretical semantics. Dedicated to the memory of Jaakko Hintikka. Cham: Springer. Outst. Contrib. Log. 12, 339-362 (2018). MSC: 03B42 PDFBibTeX XMLCite \textit{A. Herzig} et al., Outst. Contrib. Log. 12, 339--362 (2018; Zbl 1437.03066) Full Text: DOI
Fenner, Peter; Johnson, Marianne; Kambites, Mark NP-completeness in the gossip monoid. (English) Zbl 1498.20137 Int. J. Algebra Comput. 28, No. 4, 653-672 (2018). MSC: 20M05 68Q17 PDFBibTeX XMLCite \textit{P. Fenner} et al., Int. J. Algebra Comput. 28, No. 4, 653--672 (2018; Zbl 1498.20137) Full Text: DOI arXiv
Harutyunyan, Hovhannes A.; Kamali, Shahin Efficient broadcast trees for weighted vertices. (English) Zbl 1358.05279 Discrete Appl. Math. 216, Part 3, 598-608 (2017). MSC: 05C85 05C82 68M10 PDFBibTeX XMLCite \textit{H. A. Harutyunyan} and \textit{S. Kamali}, Discrete Appl. Math. 216, Part 3, 598--608 (2017; Zbl 1358.05279) Full Text: DOI
Apt, Krzysztof R.; Grossi, Davide; van der Hoek, Wiebe Epistemic protocols for distributed gossiping. (English) Zbl 1483.68361 Ramanujam, R. (ed.), Proceedings of the fifteenth conference on theoretical aspects of rationality and knowledge, TARK 2015, Carnegie Mellon University, Pittsburgh, USA, June 4–6, 2015. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 215, 51-66 (2016). MSC: 68T27 03B42 68R10 PDFBibTeX XMLCite \textit{K. R. Apt} et al., Electron. Proc. Theor. Comput. Sci. (EPTCS) 215, 51--66 (2016; Zbl 1483.68361) Full Text: arXiv Link
Brouwer, Andries E.; Draisma, Jan; Frenk, Bart J. Lossy gossip and composition of metrics. (English) Zbl 1317.15024 Discrete Comput. Geom. 53, No. 4, 890-913 (2015). MSC: 15A80 52B70 20M99 14T05 PDFBibTeX XMLCite \textit{A. E. Brouwer} et al., Discrete Comput. Geom. 53, No. 4, 890--913 (2015; Zbl 1317.15024) Full Text: DOI arXiv
Hasunuma, Toru; Nagamochi, Hiroshi Improved bounds for minimum fault-tolerant gossip graphs. (English) Zbl 1341.05041 Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 203-214 (2011). MSC: 05C10 05C38 PDFBibTeX XMLCite \textit{T. Hasunuma} and \textit{H. Nagamochi}, Lect. Notes Comput. Sci. 6986, 203--214 (2011; Zbl 1341.05041) Full Text: DOI
Kempe, David; Kleinberg, Jon; Kumar, Amit Connectivity and inference problems for temporal networks. (English) Zbl 1015.68005 J. Comput. Syst. Sci. 64, No. 4, 820-842 (2002). MSC: 68M10 PDFBibTeX XMLCite \textit{D. Kempe} et al., J. Comput. Syst. Sci. 64, No. 4, 820--842 (2002; Zbl 1015.68005) Full Text: DOI
Fraigniaud, Pierre; Peters, Joseph G. Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs. (English) Zbl 0993.94026 Networks 38, No. 3, 150-162 (2001). Reviewer: Wai Kai Chen (Chicago) MSC: 94C15 05C35 PDFBibTeX XMLCite \textit{P. Fraigniaud} and \textit{J. G. Peters}, Networks 38, No. 3, 150--162 (2001; Zbl 0993.94026) Full Text: DOI
Gargano, Luisa; Rescigno, Adele A. Communication complexity of fault-tolerant information diffusion. (English) Zbl 0912.68028 Theor. Comput. Sci. 209, No. 1-2, 195-211 (1998). MSC: 68P99 PDFBibTeX XMLCite \textit{L. Gargano} and \textit{A. A. Rescigno}, Theor. Comput. Sci. 209, No. 1--2, 195--211 (1998; Zbl 0912.68028) Full Text: DOI
Krumme, David W. Reordered gossip schemes. (English) Zbl 0861.68065 Discrete Math. 156, No. 1-3, 113-140 (1996). MSC: 68R10 90B18 PDFBibTeX XMLCite \textit{D. W. Krumme}, Discrete Math. 156, No. 1--3, 113--140 (1996; Zbl 0861.68065) Full Text: DOI
Chang, Gerard J.; Tsay, Yuh-Jiuan The partial gossiping problem. (English) Zbl 0841.90063 Discrete Math. 148, No. 1-3, 9-14 (1996). MSC: 90B18 05C35 PDFBibTeX XMLCite \textit{G. J. Chang} and \textit{Y.-J. Tsay}, Discrete Math. 148, No. 1--3, 9--14 (1996; Zbl 0841.90063) Full Text: DOI
Hromkovič, Juraj; Jeschke, Claus-Dieter; Monien, Burkhard Note on optimal gossiping in some weak-connected graphs. (English) Zbl 0824.68010 Theor. Comput. Sci. 127, No. 2, 395-402 (1994). MSC: 68M10 68R10 PDFBibTeX XMLCite \textit{J. Hromkovič} et al., Theor. Comput. Sci. 127, No. 2, 395--402 (1994; Zbl 0824.68010) Full Text: DOI
Fraigniaud, Pierre; Lazard, Emmanuel Methods and problems of communication in usual networks. (English) Zbl 0818.94029 Discrete Appl. Math. 53, No. 1-3, 79-133 (1994). Reviewer: M.Middendorf (Karlsruhe) MSC: 94C15 94-02 94A05 05C90 PDFBibTeX XMLCite \textit{P. Fraigniaud} and \textit{E. Lazard}, Discrete Appl. Math. 53, No. 1--3, 79--133 (1994; Zbl 0818.94029) Full Text: DOI
Feldmann, R.; Hromkovič, Juraj; Madhavapeddy, S.; Monien, B.; Mysliwietz, P. Optimal algorithms for dissemination of information in generalized communication modes. (English) Zbl 0823.68041 Discrete Appl. Math. 53, No. 1-3, 55-78 (1994). MSC: 68Q25 05C90 68R10 94C15 PDFBibTeX XMLCite \textit{R. Feldmann} et al., Discrete Appl. Math. 53, No. 1--3, 55--78 (1994; Zbl 0823.68041) Full Text: DOI
Hromkovič, Juraj; Jeschke, Claus-Dieter; Monien, Burkhard Optimal algorithms for dissemination of information in some interconnection networks. (English) Zbl 0773.68007 Algorithmica 10, No. 1, 24-40 (1993). MSC: 68M10 68Q25 PDFBibTeX XMLCite \textit{J. Hromkovič} et al., Algorithmica 10, No. 1, 24--40 (1993; Zbl 0773.68007) Full Text: DOI
Gargano, Luisa Tighter time bounds on fault-tolerant broadcasting and gossiping. (English) Zbl 0758.90033 Networks 22, No. 5, 469-486 (1992). MSC: 90B18 90B25 PDFBibTeX XMLCite \textit{L. Gargano}, Networks 22, No. 5, 469--486 (1992; Zbl 0758.90033) Full Text: DOI
Lee, Hsun-Ming; Chang, Gerard J. Set to set broadcasting in communication networks. (English) Zbl 0765.94027 Discrete Appl. Math. 40, No. 3, 411-421 (1992). MSC: 94C15 94A05 PDFBibTeX XMLCite \textit{H.-M. Lee} and \textit{G. J. Chang}, Discrete Appl. Math. 40, No. 3, 411--421 (1992; Zbl 0765.94027) Full Text: DOI
Hedetniemi, Sandra M.; Hedetniemi, Stephen T.; Liestman, Arthur L. A survey of gossiping and broadcasting in communication networks. (English) Zbl 0649.90047 Networks 18, No. 4, 319-349 (1988). MSC: 90B10 PDFBibTeX XMLCite \textit{S. M. Hedetniemi} et al., Networks 18, No. 4, 319--349 (1988; Zbl 0649.90047) Full Text: DOI
Haddad, Ramsey W.; Roy, Shaibal; Schäffer, Alejandro A. On gossiping with faulty telephone lines. (English) Zbl 0626.05033 SIAM J. Algebraic Discrete Methods 8, 439-445 (1987). MSC: 05C38 94C15 PDFBibTeX XMLCite \textit{R. W. Haddad} et al., SIAM J. Algebraic Discrete Methods 8, 439--445 (1987; Zbl 0626.05033) Full Text: DOI
Seress, Ákos Quick gossiping without duplicate transmissions. (English) Zbl 0601.05029 Graphs Comb. 2, 363-381 (1986). MSC: 05C38 94A05 05C99 PDFBibTeX XMLCite \textit{Á. Seress}, Graphs Comb. 2, 363--381 (1986; Zbl 0601.05029) Full Text: DOI
Berman, Kenneth A.; Hawrylycz, Michael Telephone problems with failures. (English) Zbl 0578.05059 SIAM J. Algebraic Discrete Methods 7, 13-17 (1986). MSC: 05C35 90B10 94C15 PDFBibTeX XMLCite \textit{K. A. Berman} and \textit{M. Hawrylycz}, SIAM J. Algebraic Discrete Methods 7, 13--17 (1986; Zbl 0578.05059) Full Text: DOI
Liestman, Arthur L.; Richards, Dana Toward optimal gossiping schemes with conference calls. (English) Zbl 0529.05043 Discrete Appl. Math. 7, 183-189 (1984). MSC: 05C65 05C35 94A99 PDFBibTeX XMLCite \textit{A. L. Liestman} and \textit{D. Richards}, Discrete Appl. Math. 7, 183--189 (1984; Zbl 0529.05043) Full Text: DOI
Assmann, Susan F.; Kleitman, Daniel J. The number of rounds needed to exchange information within a graph. (English) Zbl 0519.05044 Discrete Appl. Math. 6, 117-125 (1983). MSC: 05C35 05C99 94A99 PDFBibTeX XMLCite \textit{S. F. Assmann} and \textit{D. J. Kleitman}, Discrete Appl. Math. 6, 117--125 (1983; Zbl 0519.05044) Full Text: DOI
Seress, Akos Gossiping old ladies. (English) Zbl 0518.05001 Discrete Math. 46, 75-81 (1983). MSC: 05A05 05C99 PDFBibTeX XMLCite \textit{A. Seress}, Discrete Math. 46, 75--81 (1983; Zbl 0518.05001) Full Text: DOI
West, Douglas B. A class of solutions to the gossip problem. I. (English) Zbl 0497.05037 Discrete Math. 39, 307-326 (1982). MSC: 05C38 94A05 05C99 05C75 05C70 PDFBibTeX XMLCite \textit{D. B. West}, Discrete Math. 39, 307--326 (1982; Zbl 0497.05037) Full Text: DOI
Bumby, Richard T. A problem with telephones. (English) Zbl 0499.05034 SIAM J. Algebraic Discrete Methods 2, 13-18 (1981). MSC: 05C35 05C38 05C40 PDFBibTeX XMLCite \textit{R. T. Bumby}, SIAM J. Algebraic Discrete Methods 2, 13--18 (1981; Zbl 0499.05034) Full Text: DOI
Entringer, Roger C.; Slater, Peter J. Gossips and telegraphs. (English) Zbl 0408.05051 J. Franklin Inst. 307, 353-360 (1979). MSC: 05C99 PDFBibTeX XMLCite \textit{R. C. Entringer} and \textit{P. J. Slater}, J. Franklin Inst. 307, 353--360 (1979; Zbl 0408.05051) Full Text: DOI
Harary, Frank; Schwenk, Allen J. The communication problem on graphs. (English) Zbl 0307.05118 J. Franklin Inst. 297, 491-495 (1974). MSC: 05C30 05C20 PDFBibTeX XMLCite \textit{F. Harary} and \textit{A. J. Schwenk}, J. Franklin Inst. 297, 491--495 (1974; Zbl 0307.05118) Full Text: DOI
Baker, Brenda; Shostak, Robert Gossips and telephones. (English) Zbl 0245.05002 Discrete Math. 2, 191-193 (1972). MSC: 05A05 PDFBibTeX XMLCite \textit{B. Baker} and \textit{R. Shostak}, Discrete Math. 2, 191--193 (1972; Zbl 0245.05002) Full Text: DOI