Stable structural clustering in uncertain graphs
From MaRDI portal
Publication:6154469
Cites work
- A community detection algorithm based on graph compression for large-scale social networks
- Clustering probabilistic graphs using neighbourhood paths
- Efficient pattern matching on big uncertain graphs
- Negative influence blocking maximization with uncertain sources under the independent cascade model
- Online force-directed algorithms for visualization of dynamic graphs
- Semantics-aware influence maximization in social networks
- The Structure and Function of Complex Networks
This page was built for publication: Stable structural clustering in uncertain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154469)