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

Graph Coloring #4230

Closed
ChuckHastings opened this issue Mar 11, 2024 · 0 comments · Fixed by #4211
Closed

Graph Coloring #4230

ChuckHastings opened this issue Mar 11, 2024 · 0 comments · Fixed by #4211
Assignees
@naimnv

Comments

@ChuckHastings
Copy link
Collaborator

Provide an algorithm for performing graph coloring.

Given a graph view, assign a unique integer to each vertex so that no two adjacent vertices have the same value. Integers should be assigned from 0, we should use the minimum number of possible colors (integer values).
@ChuckHastings ChuckHastings mentioned this issue Mar 11, 2024
Merged
rapids-bot bot pushed a commit that referenced this issue Mar 12, 2024
@naimnv
Graph coloring and MIS (#4211)
a4eab99 
This PR implements 
- MNMG Graph Coloring
- MNMG MIS for general graphs

Closes #4230 
Closes #4231

Authors:
  - Naim (https://github.com/naimnv)

Approvers:
  - Seunghwa Kang (https://github.com/seunghwak)
  - Chuck Hastings (https://github.com/ChuckHastings)

URL: #4211
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@naimnv naimnv

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

Graph coloring and MIS naimnv/cugraph-forked
2 participants
@ChuckHastings @naimnv