Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[Feature Request] Graph partitioning in FGraph #50

Open
LibraChris opened this issue Sep 22, 2023 · 0 comments
Open

[Feature Request] Graph partitioning in FGraph #50

LibraChris opened this issue Sep 22, 2023 · 0 comments
Labels
Difficulty: Advanced Hackathon projects with advanced difficulty enhancement New feature or request

Comments

@LibraChris
Copy link
Collaborator

  • 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.
@LibraChris LibraChris added enhancement New feature or request Difficulty: Advanced Hackathon projects with advanced difficulty labels Sep 22, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
Difficulty: Advanced Hackathon projects with advanced difficulty enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@LibraChris