Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size

Jan Niclas Dreier, Philipp Kuinke, Peter Rossmanith
January 2020
PDF bib DOI

Abstract

Full Citation:

Jan Dreier, Philipp Kuinke, Peter Rossmanith. Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), volume 176 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Type
Conference Paper
Jan Niclas Dreier
Jan Niclas Dreier

Jan Niclas Dreier is a Postdoctoral Researcher at the Algorithms and Complexity Group.