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

How do we perform bipartite coloring? #12

Closed
gdalle opened this issue May 18, 2024 · 2 comments
Closed

How do we perform bipartite coloring? #12

gdalle opened this issue May 18, 2024 · 2 comments

Comments

@gdalle
Copy link
Collaborator

gdalle commented May 18, 2024

At the moment the only example I had to work with (from the README) transforms a sparse Jacobian into a column adjacency matrix with matrix2adjmatrix.
What happens when we want to do a partial distance 2 coloring on the bipartite graph? Do we just supply the matrix directly without transformation?
What if we want to color the rows instead of the columns? Do we supply its transpose?

This was referenced May 18, 2024
@gdalle
Copy link
Collaborator Author

gdalle commented May 24, 2024

@michel2323 any clues?

@gdalle
Copy link
Collaborator Author

gdalle commented Jun 4, 2024

I have performed a small test and I have my answer: bipartite coloring does not seem to be supported. A bipartite row-column adjacency matrix must be converted to an adjacency matrix (which represents a much denser graph), otherwise this line throws an AssertionError:

@assert issymmetric(M)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants