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 |
---|---|
其他作者: | School of Computer Science and Engineering |
格式: | Article |
語言: | English |
出版: |
2019
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/103688 http://hdl.handle.net/10220/48596 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Multi-relation graph summarization
由: Ke, Xiangyu, et al.
出版: (2022) -
uBlade: efficient batch processing for uncertainty graph queries
由: YAO, Siyuan, et al.
出版: (2024) -
On efficiently finding reverse K-nearest neighbors over uncertain graphs
由: GAO, Yunjun, et al.
出版: (2017) -
Summarizing static and dynamic big graphs
由: Khan, Arijit, et al.
出版: (2019) -
Experimental evaluation of reliability estimation over uncertain graphs
由: Lim, Leroy Hong Quan
出版: (2018)