×

Found 8 Documents (Results 1–8)

Building spanning trees quickly in maker-breaker games. (English) Zbl 1294.05114

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, 365-370 (2013).
PDFBibTeX XMLCite

Hitting time results for maker-breaker games (extended abstract). (English) Zbl 1377.91042

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 900-912 (2011).
MSC:  91A43 05C57 05C80
PDFBibTeX XMLCite
Full Text: Link

Fast embedding of spanning trees in biased maker-breaker games. (English) Zbl 1274.05320

Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 331-336 (2011).
MSC:  05C57 05C05
PDFBibTeX XMLCite
Full Text: arXiv Link

Filter Results by …

Document Type

Year of Publication

Main Field