v****s
发帖数: 1112 | 1 What'll be the best algorithm for finding signed triad in large scale
graph, details as follows:
Given a graph with 1 million nodes and about 8 million edges (so, avg
degree is 8 ), 85% of the edges are marked as "+" and 15% as "-".
What will be the best algorithm or data structure involved to find
out the numbers of these 4 possible types of signed triad (a triangle
subgraph having 3 nodes and 3 edges) in this graph.
The four kinds of signed triad are:
+++
+--
++- | v****s
发帖数: 1112 | 2 ???
【在 v****s 的大作中提到】
: What'll be the best algorithm for finding signed triad in large scale
: graph, details as follows:
: Given a graph with 1 million nodes and about 8 million edges (so, avg
: degree is 8 ), 85% of the edges are marked as "+" and 15% as "-".
: What will be the best algorithm or data structure involved to find
: out the numbers of these 4 possible types of signed triad (a triangle
: subgraph having 3 nodes and 3 edges) in this graph.
: The four kinds of signed triad are:
: +++
: +--
|
|
