×

Found 22 Documents (Results 1–22)

Non-homotopic loops with a bounded number of pairwise intersections. (English) Zbl 07551744

Purchase, Helen C. (ed.) et al., Graph drawing and network visualization. 29th international symposium, GD 2021, Tübingen, Germany, September 14–17, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12868, 210-222 (2021).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Asymptotic normality of almost local functionals in conditioned Galton-Watson trees. (English) Zbl 1482.05043

Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 33, 17 p. (2018).
MSC:  05C05 60F05 60J80
PDFBibTeX XMLCite
Full Text: DOI

Using Pólya urns to show normal limit laws for fringe subtrees in \(m\)-ary search trees. (English) Zbl 1411.68037

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:  68P05 60C05 68W40
PDFBibTeX XMLCite

Regular hypergraphs: asymptotic counting and loose Hamilton cycles. (English) Zbl 1291.05139

Nešetřil, Jaroslav (ed.) et al., The seventh European conference on combinatorics, graph theory and applications. Extended abstracts of EuroComb 2013, Pisa, Italy, September 9–13, 2013. Pisa: Edizioni della Normale (ISBN 978-88-7642-474-8/pbk; 978-88-7642-475-5/ebook). Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 16, 483-486 (2013).
MSC:  05C65 05C30 05C45
PDFBibTeX XMLCite

Filter Results by …

Database

all top 5

Year of Publication

Main Field