pdf-format: |
|
@InProceedings{dreier_et_al:LIPIcs:2020:12617, author = {Jan Dreier and Philipp Kuinke and Peter Rossmanith}, title = {{Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {14:1--14:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Jaros{\l}aw Byrka and Raghu Meka}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12617}, URN = {urn:nbn:de:0030-drops-126171}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.14}, annote = {Keywords: Random Graphs, Preferential Attachment, Sparsity, Somewhere Dense} }
Keywords: | Random Graphs, Preferential Attachment, Sparsity, Somewhere Dense | |
Seminar: | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) | |
Issue date: | 2020 | |
Date of publication: | 11.08.2020 |