|Home Wiki Blog Forum GEXF.net|
Ramonero wrote:About the notion of "familiarity" it sounds interesting but i couldn't find anything related to on the web.
Flow networks or seed sets are not very close to what i am looking for neither. It seems i didn´t explain very good.
What i am working in is closer to concept of small world networks than huge networks.
The algorithm that I couldn't remember earlier is about finding center-piece subgraphs. There is a paper about it at http://www.cs.cmu.edu/~christos/PUBLICA ... 06CePS.pdf. Also the author has given link to Matlab code for the implementation at his website: http://www.cs.cmu.edu/~htong/sel.htm.
Given Q nodes in a social network (say, authorship network), how can we ﬁnd the node/author that is the centerpiece, and has direct or indirect connections to all, or most of them?
Apparently it's still not exactly what you are looking for. Good luck regardless!
Users browsing this forum: Bing [Bot] and 0 guests