Balanced Triads

[mknblch]

Balanced Triads

Progress

• implement algorithm as java class
• unit tests
• implement procedure
• tests
• simple benchmark
• manual benchmark (on bigger graphs)
• parallelization
• evaluation
• documentation

Implementation details

To calculate if a triangle is balanced we have to assign each edge with either a positive or negative mark (which may be friendship relationships etc.). The algorithm should be ran using an undirected graph.

To check the sign of a relationship im using a simple comparision v >= 0 of a given weightProperty.
Since a node can be member of several triangles we now have 2 different results, the number of balanced and unbalanced triangles the node is part of.

TODO

References

• TODO (papers, existing implementations, links to thoughts)