Hey, I am following this research paper whose findings I have to replicate. And one of their graphs has 5million nodes and 69 million edges. That's the smallest dataset they are using.
Ruchika On 15 Dec 2016 14:37, "Tamás Nepusz" <[email protected]> wrote: > Hi, > > Out of curiosity: how large are your graphs? (How many nodes, how many > edges?) > > T. > > > On 2016. Dec 15., at 8:44, Ruchika Salwan <[email protected]> > wrote: > > > > Hi, > > > > As part of my project, I need to implement truss decomposition algorithm > for graphs too large to fit in memory. But I believe implementing this > using igraph API would lead to massive changes to the igraph C interface(I > am doing this in C). > > > > I need some expert views on it. Is it feasible to do so using the igraph > API. And what are the quick fixes I can perform to achieve this, just in > case. > > > > Thanks, > > > > Ruchika > > _______________________________________________ > > igraph-help mailing list > > [email protected] > > https://lists.nongnu.org/mailman/listinfo/igraph-help > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
