Motif Counting in Preferential Attachment Graphs

DOI10.4230/LIPICS.FSTTCS.2019.13MaRDI QIDQ5875645zbMATH OpenOpenAlexFDO

Authors Jan Dreier, Peter Rossmanith

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.FSTTCS.2019.13

zbMATH Keywords

average case analysismotif countingpreferential attachment graphsrandom graphs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(2)

• First-Order Model-Checking in Random Graphs and Complex Networks
• Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size

This page was built for publication: Motif Counting in Preferential Attachment Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875645)