Pages that link to "Item:Q5002730"
From MaRDI portal
The following pages link to Finding cliques in social networks: a new distribution-free model (Q5002730):
Displaying 8 items.
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
- A balm: defend the clique-based attack from a fundamental aspect (Q2082182) (← links)
- Exploiting the formation of maximal cliques in social networks (Q2333517) (← links)
- Map graphs having witnesses of large girth (Q2632022) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← links)
- A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model (Q5160880) (← links)
- A new model for a scale-free hierarchical structure of isolated cliques (Q5891344) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)