Uncertain Graph Processing through Representative Instances

DOI10.1145/2818182MaRDI QIDQ5012539zbMATH OpenOpenAlexFDO

Authors Panos Parchas, Francesco Gullo, Dimitris Papadias, Francesco Bonchi

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2818182

zbMATH Keywords

representativepossible worlduncertain graph\(n\)-clique cardinality

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15)

Recommendations

• On uncertain graphs
• Effective and efficient aggregation on uncertain graphs
• Graph theoretic uncertainty and feasibility
• Uncertain graph and network optimization
• scientific article; zbMATH DE number 1487572
• An epistemic approach to model uncertainty in data-graphs

Cited in

(8)

• Generic network sparsification via degree- and subgraph-based edge sampling
• Effective and efficient aggregation on uncertain graphs
• On uncertain graphs
• An indexing framework for queries on probabilistic graphs
• Generating uncertain networks based on historical network snapshots
• Generic network sparsification via hybrid edge sampling
• Clustering of propositions equipped with uncertainty
• Motif-role extraction in uncertain graph based on efficient ensembles

This page was built for publication: Uncertain Graph Processing through Representative Instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012539)