Name
Abstract | ||
|---|---|---|
The k-truss of a graph is the largest edge-induced subgraph such that every edge is contained in at least k triangles within the subgraph, where a triangle is a cycle consisting of three vertices. As a new notion of cohesive subgraphs, truss has recently attracted a lot of research attentions in the database and data mining fields. At the same time, uncertainty is an intrinsic property of massive graph data, and truss decomposition (i.e., finding all k-trusses of a graph) has become a key primitive on uncertain graphs. In this paper, we study the truss decomposition problem on uncertain graphs, that is, finding all highly probable k-trusses of an uncertain graph. We first give an formal statement of the truss decomposition problem on uncertain graphs. Then, we prove that the truss decomposition of an uncertain graph attains two elegant properties, namely uniqueness and hierarchy. We show that the truss decomposition of an uncertain graph can be found in $$O(m^{1.5}Q)$$O(m1.5Q) time by proposing an in-memory algorithm called $$\\mathtt {TD_{mem}}$$TDmem, where m is the number of edges of the uncertain graph, and Q is at most the maximum number of common neighbors of the endpoints of an edge. When an uncertain graph is too large to fit into main memory, we propose an external-memory algorithm $$\\mathtt {TD_{I/O}}$$TDI/O to find the truss decomposition of the uncertain graph. Extensive experiments have been carried out to evaluate the practical performance of the proposed algorithms. The experimental results verify that both $$\\mathtt {TD_{mem}}$$TDmem and $$\\mathtt {TD_{I/O}}$$TDI/O are efficient when an uncertain graph is small enough to fit into main memory, and that $$\\mathtt {TD_{I/O}}$$TDI/O is much faster than $$\\mathtt {TD_{mem}}$$TDmem when the graph is too large to fit into main memory. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10115-016-0943-y | Knowl. Inf. Syst. |
Keywords | Field | DocType |
Cohesive subgraph, Truss, Truss decomposition, Truss number, Uncertain graph | Discrete mathematics,Modular decomposition,Combinatorics,Line graph,Graph factorization,Distance-hereditary graph,Factor-critical graph,Butterfly graph,Universal graph,Voltage graph,Mathematics | Journal |
Volume | Issue | ISSN |
50 | 1 | 0219-3116 |
Citations | PageRank | References |
3 | 0.36 | 28 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhaonian Zou | 1 | 331 | 15.78 |
| Rong Zhu | 2 | 12 | 2.81 |