Dear list, have a list of graphs (igraph format) and I would like to obtain a merge graph, which would be the intersection of those nodes and vertices that are shared a certain percentage trough all the graphs. I know that igraph library has the function graph.intersection() but this function intersect all the vertices and nodes present in all the graphs. Any help would be much appreciated Juan
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
