A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
External memory K-bisimulation reduction of big graphs
2013
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13
In this paper, we present, to our knowledge, the first known I/O efficient solutions for computing the k-bisimulation partition of a massive directed graph, and performing maintenance of such a partition upon updates to the underlying graph. Ubiquitous in the theory and application of graph data, bisimulation is a robust notion of node equivalence which intuitively groups together nodes in a graph which share fundamental structural features. kbisimulation is the standard variant of bisimulation
doi:10.1145/2505515.2505752
dblp:conf/cikm/LuoFHWB13
fatcat:iyu5xa5hdnfsvoimqytzygtdwy