Effective and efficient aggregation on uncertain graphs
From MaRDI portal
Recommendations
Cites work
- An efficient algorithm for link prediction in temporal uncertain social networks
- An indexing framework for queries on probabilistic graphs
- Configuring random graph models with fixed degree sequences
- Connectedness index of uncertain graph
- Detecting robust cliques in graphs subject to uncertain edge failures
- Efficient clustering of large uncertain graphs using neighborhood information
- Efficient pattern matching on big uncertain graphs
- Euler index in uncertain graph
- Minimized-cost cube query on heterogeneous information networks
- Probabilistic SimRank computation over uncertain graphs
- Uncertain Graph Processing through Representative Instances
Cited in
(7)- Adaptive aggregation on graphs
- Efficient clustering of large uncertain graphs using neighborhood information
- Motif-role extraction in uncertain graph based on efficient ensembles
- An efficient weighted graph aggregation algorithm
- On uncertain graphs
- Sampling-based collection and updating of online big graph data
- Uncertain Graph Processing through Representative Instances
This page was built for publication: Effective and efficient aggregation on uncertain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6079441)