×

Found 174 Documents (Results 1–100)

Accelerated information dissemination on networks with local and global edges. (English) Zbl 07615852

Parter, Merav (ed.), Structural information and communication complexity. 29th international colloquium, SIROCCO 2022, Paderborn, Germany, June 27–29, 2022, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13298, 79-97 (2022).
MSC:  68Mxx 68Q11 68R10
PDF BibTeX XML Cite
Full Text: DOI

Two phase transitions in two-way bootstrap percolation. (English) Zbl 07650238

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 5, 21 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Think globally, act locally: on the optimal seeding for nonsubmodular influence maximization. (English) Zbl 07650106

Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 39, 20 p. (2019).
MSC:  68W20 68W25 90C27
PDF BibTeX XML Cite
Full Text: DOI

Spanoids – an abstraction of spanning structures, and a barrier for LCCs. (English) Zbl 07559075

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 32, 20 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Solving target set selection with bounded thresholds faster than \(2^n\). (English) Zbl 07378608

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 22, 14 p. (2019).
MSC:  68Q25 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Tight bounds on the minimum size of a dynamic monopoly. (English) Zbl 1425.05146

Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 381-393 (2019).
MSC:  05C80 60C05 91B24
PDF BibTeX XML Cite
Full Text: DOI arXiv

Opinion forming in Erdős-Rényi random graph and expanders. (English) Zbl 07561358

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 4, 13 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Majority model on random regular graphs. (English) Zbl 1485.60012

Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 572-583 (2018).
MSC:  60C05 05C80 60K35
PDF BibTeX XML Cite
Full Text: DOI arXiv

Scaling and inverse scaling in anisotropic bootstrap percolation. (English) Zbl 1402.37023

Louis, Pierre-Yves (ed.) et al., Probabilistic cellular automata. Theory, applications and future perspectives. Cham: Springer (ISBN 978-3-319-65556-7/hbk; 978-3-319-65558-1/ebook). Emergence, Complexity and Computation 27, 69-77 (2018).
MSC:  37B15 60K35 82B43
PDF BibTeX XML Cite
Full Text: DOI arXiv

Bootstrap percolation on degenerate graphs. (English) Zbl 1397.60129

Kliewer, Natalia (ed.) et al., Operations research proceedings 2017. Selected papers of the annual international conference of the German Operations Research Society (GOR), Freie Universiät Berlin, Germany, September 6–8, 2017. Cham: Springer (ISBN 978-3-319-89919-0/pbk; 978-3-319-89920-6/ebook). Operations Research Proceedings, 303-308 (2018).
MSC:  60K35 05C80 60K37
PDF BibTeX XML Cite
Full Text: DOI arXiv

Monotone cellular automata. (English) Zbl 1423.68302

Claesson, Anders (ed.) et al., Surveys in combinatorics 2017. Papers based on the 26th British combinatorial conference, University of Strathclyde, Glasgow, UK, July 2017. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 440, 312-371 (2017).
MSC:  68Q80 37B15 82C20
PDF BibTeX XML Cite
Full Text: DOI

Extremal bounds for bootstrap percolation in the hypercube. (English) Zbl 1378.05204

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 877-883 (2017).
MSC:  05D05 60K35 60C05
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Bootstrap percolation on \(G(n,p)\) revisited. (English) Zbl 1409.05182

Neininger, Ralph (ed.) et al., Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms – AofA’16, Kraków, Poland, July 4–8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 12 p. (2016).
MSC:  05C80
PDF BibTeX XML Cite
Full Text: arXiv

Bootstrap percolation on geometric inhomogeneous random graphs. (English) Zbl 1388.68234

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 147, 15 p. (2016).
MSC:  68R10 05C80
PDF BibTeX XML Cite
Full Text: DOI arXiv

Complex contagions on configuration model graphs with a power-law degree distribution. (English) Zbl 1406.91325

Cai, Yang (ed.) et al., Web and internet economics. 12th international conference, WINE 2016, Montreal, Canada, December 11–14, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-54109-8/pbk; 978-3-662-54110-4/ebook). Lecture Notes in Computer Science 10123, 459-472 (2016).
MSC:  91D30
PDF BibTeX XML Cite
Full Text: DOI

The maximum time of 2-neighbour bootstrap percolation in grid graphs and parametrized results. (English) Zbl 1417.05225

Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 169-185 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Bootstrap percolation in random \(k\)-uniform hypergraphs. (English) Zbl 1346.05273

Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 595-601, electronic only (2015).
MSC:  05C80 05C65
PDF BibTeX XML Cite
Full Text: DOI arXiv

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software