On uncertain graphs
From MaRDI portal
Recommendations
- An indexing framework for queries on probabilistic graphs
- Effective and efficient aggregation on uncertain graphs
- Probabilistic top-k and ranking query algorithms in uncertain databases
- Uncertain Graph Processing through Representative Instances
- Probabilistic SimRank computation over uncertain graphs
Cited in
(13)- Efficient pattern matching on big uncertain graphs
- Uncertain graph and network optimization
- Graph ambiguity
- Neighborhood-based uncertainty generation in social networks
- Generating uncertain networks based on historical network snapshots
- Uncertain Graph Processing through Representative Instances
- An indexing framework for queries on probabilistic graphs
- Probabilistic SimRank computation over uncertain graphs
- On distribution function of the diameter in uncertain graph
- Method for similarity join on uncertain graph database
- Effective and efficient aggregation on uncertain graphs
- scientific article; zbMATH DE number 7724205 (Why is no real title available?)
- A survey on uncertain graph and uncertain network optimization
This page was built for publication: On uncertain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4582777)