Difference between revisions of "Common neighbors"
From Cohen Courses
Jump to navigationJump to search (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> …') |
|||
| Line 1: | Line 1: | ||
| − | Common neighbor is a directly heuristic method in many graph applications, like [[Liben-Nowell Kleinberg J. Am.Soc.Inf.Sci.2007]]. | + | Common neighbor is a directly heuristic method in many graph applications, like [[paper:Liben-Nowell Kleinberg J. Am.Soc.Inf.Sci.2007]]. |
== Formal Definition == | == Formal Definition == | ||
Revision as of 01:12, 27 September 2012
Common neighbor is a directly heuristic method in many graph applications, like paper: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.
