fslaborg / fslaborg/Graphoscope
[Feature Request] Graph partitioning in FGraph
Open
Difficulty: Advanced
enhancement
- Dominant language
- F#
- Stars
- 16
- Forks
- 6
- PR merge metrics
- No merged PRs in 30d
Description
- Graph partitioning refers to dividing a graph into smaller, non-overlapping subgraphs while optimizing some objective function or constraint.
- It can be used to optimise graph reduction and fast component parting.
- Since FGraph is based on a dictionary structure, graph partitioning can be based on dictionary partitioning.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.