About clique number estimates and exact enumeration in scale-free networks

DOI10.1093/COMNET/CNAA011MaRDI QIDQ4958795zbMATH OpenOpenAlexFDO

Authors Andrej Jursa, Mária Markošová, Boris Rudolf

Publication date 15 September 2021

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comnet/cnaa011

zbMATH Keywords

clique estimatesclique finding algorithmscale-free networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Parameterized Clique on Scale-Free Networks
• Number of cliques in random scale-free network ensembles
• Analyzing the cliques in scale-free random graphs
• Parameterized clique on inhomogeneous random graphs
• Large cliques in a power-law random graph

Cited in

(2)

• Parameterized Clique on Scale-Free Networks
• Number of cliques in random scale-free network ensembles

This page was built for publication: About clique number estimates and exact enumeration in scale-free networks

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