Motif Counting in Preferential Attachment Graphs
From MaRDI portal
Publication:5875645
DOI10.4230/LIPIcs.FSTTCS.2019.13OpenAlexW2998171950MaRDI QIDQ5875645
Publication date: 3 February 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2019.13
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Related Items (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