Common neighbors
From Cohen Courses
Revision as of 02:11, 27 September 2012 by Zhua (talk | contribs) (Created page with 'Common neighbor is a directly heuristic method in many graph applications, like Liben-Nowell Kleinberg J. Am.Soc.Inf.Sci.2007. == Formal Definition == Say <math>x, y</math> …')
Common neighbor is a directly heuristic method in many graph applications, like Liben-Nowell Kleinberg J. Am.Soc.Inf.Sci.2007.
Formal Definition
Say are two nodes in the graph, means neighbors of . Common neighbors of and consist the set: .
In many applications, only is considered.