[MADLIB-1074] Graph cut

• Type: New Feature
• Status: Open
• Priority: Major
• Resolution: Unresolved
• Component/s: Module: Graph
• Assignee: Nandish Jayaram
• Reporter: Frank McQuillan
• Created: 15/Feb/17 18:29
• Updated: 07/Aug/18 19:37

Description

Story

As a data scientist, I want to partition a graph into k-partitions, so that I can work on the partitions separately, in part for performance reasons.

References

[1] "Multilevel k-way Partitioning Scheme for Irregular Graphs"​ , which talks about a scalable approach to partition a graph into k-partitions by first coarsening the graph, partitioning the coarsened graph into k parts and than un-coarsening later.

Issue Links

• mentioned in: Page Loading...