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
.
Efficient identifications of structural similarities for graphs
2012
Journal of combinatorial optimization
Measuring and detecting graph similarities is an important topic with numerous applications. Early algorithms often incur quadratic time or higher, making them unsuitable for graphs of very large scales. Motivated by the cooling process of an object in a thermodynamic system, we devise a new method for measuring graph similarities that can be carried out in linear time. Our algorithm, called Random Walker Termination (RWT), employs a large number of random walkers to capture the structure of a
doi:10.1007/s10878-012-9505-8
fatcat:iqqllrljxfbbrao73o36bgweem