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.

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

Implement more advanced refinement moves for graph partitioning #56

Open
sommerlukas opened this issue Jun 1, 2021 · 0 comments
Open
Assignees
Labels
enhancement New feature or request

Comments

@sommerlukas
Copy link
Member

The paper by Moreira et al. in Evolutionary multi-level acyclic graph partitioning, in Chapter 6 defines more advanced refinement moves than currently implemented. This moves have the potential to reduce communication cost. Implement advanced moves in the existing infrastructure.

@sommerlukas sommerlukas added the enhancement New feature or request label Jul 20, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

2 participants