thank you very much Sebastian
2013/10/16 Sebastian Schelter <[email protected]> > Hi, > > If you're interested in betweeness centrality, I suggest you have a look > at this paper [1] which proposes an algorithm called LineRank as > scalable substitute for betweeness centrality. > > Best, > Sebastian > > [1] http://www.cs.cmu.edu/~ukang/papers/CentralitySDM2011.pdf > > > On 16.10.2013 08:44, Silvio Di gregorio wrote: > > I'm also trying to implement but with poor results. my target is the > > betweenness Centrality. > > The only thing that i did is generate giraph code throught Green-Marl, > but > > this is very far from being a running code. > > Update us if there are progress. > > But if complexity is quadratic in the of space it's hard to do. > > > > > > 2013/10/16 Jyoti Yadav <[email protected]> > > > >> Hi Silvio.. > >> Thanks for your reply... > >> Yes, I want to realize All-source- shortest -path..Would you please > help > >> me out.? > >> > >> > >> > >> > >> On Tue, Oct 15, 2013 at 12:45 PM, Silvio Di gregorio < > >> [email protected]> wrote: > >> > >>> Do you want realize all-source-shortest path? > >>> Il giorno 15/ott/2013 11:21, "Jyoti Yadav" <[email protected] > > > >>> ha scritto: > >>> > >>> Hi.. > >>>> If I want to run SingleSourceShortest Path example given in Giraph > for > >>>> all the vertices ,then what changes I need to introduce and how ?? > >>>> How master node will come to know that algorithm has successfully > >>>> completed for one vertex and it has to consider other vertex and > >>>> reinitialize the vertex values .. > >>>> > >>>> Any ideas are really appreciated.... > >>>> > >>>> Jyoti Yadav > >>>> > >>> > >> > > > >
