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

Enhance Graph Algorithm Implementation by Providing A Priori Probability of Graphs (Labels and Rels) #119

Open
mdindoost opened this issue May 6, 2024 · 1 comment
Assignees

Comments

@mdindoost
Copy link
Contributor

In order to facilitate the implementation of various algorithms and foster research in graph theory, it is imperative to have access to a priori probabilities of Nodes' labels and edges' rels of graphs. This addition would significantly enhance the efficiency and effectiveness of graph-related endeavors, enabling users to make informed decisions and conduct thorough analyses.

@alvaradoo alvaradoo self-assigned this Oct 21, 2024
@mdindoost mdindoost self-assigned this Dec 19, 2024
@mdindoost
Copy link
Contributor Author

We are working on it for VF2-SI implementation

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

No branches or pull requests

2 participants