[MADLIB-1121] Graph - Betweenness centrality

• Type: New Feature
• Status: Open
• Priority: Major
• Resolution: Unresolved
• Component/s: Module: Graph
• Assignee: Unassigned
• Reporter: Frank McQuillan
• Created: 15/Jun/17 23:35
• Updated: 07/Aug/18 19:38

Description

Follow on from https://issues.apache.org/jira/browse/MADLIB-1072. Given that this story is complete, what measures can we compute from APSP?

Betweenness may use the APSP result set, or implement as a separate algorithm, e.g., [1].

References

[1] A Faster Algorithm for Betweenness Centrality
http://www.algo.uni-konstanz.de/publications/b-fabc-01.pdf
(used in Gephi)

[2] Network properties
https://en.wikipedia.org/wiki/Network_science#Network_properties

Issue Links

• mentioned in: Page Loading...