Hi Martin,
> What I got in mind is something like:
> 1 Compute partitions or a set of subgraphs
> (via CC, LP, Pattern Matching, ...)
> 2 Partition Vertices by computed Partition/Subgraph ID
> 3 Compute Algorithm X (Page Rank, BC, SSSP, FSM...) per
> Partition/Subgraph via PC iteration
I did try
Hi Martin,
thanks for your input!
On 7 January 2016 at 09:36, Martin Junghanns
wrote:
> Hi,
>
> this would be a very nice addition! I had a glimpse look into the PC
> implementation and the two library algorithms and when you get the
> idea, it is easy to follow what's happening. The benchmark
Hi,
this would be a very nice addition! I had a glimpse look into the PC
implementation and the two library algorithms and when you get the
idea, it is easy to follow what's happening. The benchmark results are
also very promising.
I got some questions about partitions:
1) I was wondering if the
