-- Forwarded message --
From: Jyoti Yadav
Date: Wed, Nov 6, 2013 at 9:08 PM
Subject: Re: About Giraph Design
To: s...@apache.org
Hi ..
in your earlier posts,you mentioned that running
SimpleShortestPathsComputation example given in giraph examples for v
number of times where v
You could implement the LineRank algorithm, which was proposed as a
scalable substitute for betweeness centrality:
http://www.cs.cmu.edu/~ukang/papers/CentralitySDM2011.pdf
--sebastian
On 28.10.2013 17:09, Jyoti Yadav wrote:
> Thanks Sebastian for your reply.
> If we want to implement Betweennes
Thanks Sebastian for your reply.
If we want to implement Betweenness Centrality algo then what should we do?
Regards
Jyoti
On Mon, Oct 28, 2013 at 6:10 PM, Sebastian Schelter wrote:
> Hi Jyoti,
>
> All-Pairs-Shortest-Path is a problem with a solution quadratic in the
> number of vertices of th
Hi Jyoti,
All-Pairs-Shortest-Path is a problem with a solution quadratic in the
number of vertices of the input graph. For a reasonably large graph, you
cannot even store the result.
For most algorithms that map well to systems like Giraph the amount of
messages per iteration is linear in the num
Hi..
one doubt is disturbing me..Would anyone suggest an idea?
Is GIRAPH is designed for solving problems like AllPairShortestPath ?
Thanks in advance.
Jyoti
