Parameterized Clique on Scale-Free Networks
From MaRDI portal
Recommendations
- Parameterized clique on inhomogeneous random graphs
- Analyzing the cliques in scale-free random graphs
- About clique number estimates and exact enumeration in scale-free networks
- Asymptotics for cliques in scale-free random graphs
- Structural properties of random networks of cliques
- Number of cliques in random scale-free network ensembles
- Clique percolation
- Cliques in random graphs
- Scale-free network clustering in hyperbolic and other random graphs
- Large cliques in a power-law random graph
Cited in
(15)- De-anonymization of heterogeneous random graphs in quasilinear time
- Parameterized clique on inhomogeneous random graphs
- On the average-case complexity of parameterized clique
- Large cliques in a power-law random graph
- Algorithmic complexity of power law networks
- On the kernel size of clique cover reductions for random intersection graphs
- About clique number estimates and exact enumeration in scale-free networks
- Finding cliques in social networks: a new distribution-free model
- Finding cliques in social networks: a new distribution-free model
- Superlogarithmic cliques in dense inhomogeneous random graphs
- Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs
- A new model for a scale-free hierarchical structure of isolated cliques
- On designing networks resilient to clique blockers
- Cliques in hyperbolic random graphs
- Number of cliques in random scale-free network ensembles
This page was built for publication: Parameterized Clique on Scale-Free Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909582)