Conditional reliability in uncertain graphs
Network reliability is a well-studied problem that requires to measure the probability that a target node is reachable from a source node in a probabilistic (or uncertain) graph, i.e., a graph where every edge is assigned a probability of existence. Many approaches and problem variants have been con...
Saved in:
Main Authors: | Khan, Arijit, Bonchi, Francesco, Gullo, Francesco, Nufer, Andreas |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/103688 http://hdl.handle.net/10220/48596 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Multi-relation graph summarization
by: Ke, Xiangyu, et al.
Published: (2022) -
uBlade: efficient batch processing for uncertainty graph queries
by: YAO, Siyuan, et al.
Published: (2024) -
Summarizing static and dynamic big graphs
by: Khan, Arijit, et al.
Published: (2019) -
On efficiently finding reverse K-nearest neighbors over uncertain graphs
by: GAO, Yunjun, et al.
Published: (2017) -
Experimental evaluation of reliability estimation over uncertain graphs
by: Lim, Leroy Hong Quan
Published: (2018)