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

Support for building an adjacency graph from only one triangle of a sparse symmetric matrix #98

Open
amontoison opened this issue Sep 19, 2024 · 2 comments
Open

Support for building an adjacency graph from only one triangle of a sparse symmetric matrix #98

amontoison opened this issue Sep 19, 2024 · 2 comments
Assignees
@amontoison
Labels
performance Speeding things up

Comments

@amontoison
Copy link
Collaborator

No description provided.

@amontoison amontoison self-assigned this Sep 19, 2024
@gdalle gdalle linked a pull request Sep 20, 2024 that will close this issue
Add tests with Symmetric and Hermitian inputs #100
Merged
@gdalle gdalle mentioned this issue Sep 20, 2024
Merged
@gdalle gdalle removed a link to a pull request Sep 20, 2024
Add tests with Symmetric and Hermitian inputs #100
Merged
@gdalle gdalle added the performance Speeding things up label Sep 20, 2024
@gdalle
Copy link
Owner

gdalle commented Sep 20, 2024

Note that the key challenge here is to avoid slowing down neighbors operations

@amontoison
Copy link
Collaborator Author

It's even more relevant now that our two variants of bicoloring depend on symmetric star and acyclic colorings

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

@amontoison amontoison

Labels
performance Speeding things up
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@gdalle @amontoison