- (Bonchi et al., 2014) ⇒ Francesco Bonchi, Francesco Gullo, Andreas Kaltenbrunner, and Yana Volkovich. (2014). “Core Decomposition of Uncertain Graphs.” In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2014) Journal. ISBN:978-1-4503-2956-9 doi:10.1145/2623330.2623655
Core decomposition has proven to be a useful primitive for a wide range of graph analyses. One of its most appealing features is that, unlike other notions of dense subgraphs, it can be computed linearly in the size of the input graph.
In this paper we provide an analogous tool for uncertain graphs, i.e., graphs whose edges are assigned a probability of existence. The fact that core decomposition can be computed efficiently in deterministic graphs does not guarantee efficiency in uncertain graphs, where even the simplest graph operations may become computationally intensive. Here we show that core decomposition of uncertain graphs can be carried out efficiently as well.
|2014 CoreDecompositionofUncertainGra||Francesco Bonchi|
|Core Decomposition of Uncertain Graphs||10.1145/2623330.2623655||2014|
|Author||Francesco Bonchi +, Francesco Gullo +, Andreas Kaltenbrunner + and Yana Volkovich +|
|proceedings||Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining +|
|title||Core Decomposition of Uncertain Graphs +|