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

Algorithms Incorporating Node and Edge Attributes in Graph Generation #3

Open
SyedZainAbbas opened this issue Nov 29, 2024 · 0 comments

Comments

@SyedZainAbbas
Copy link

I am currently working on generating graphs and have noticed that many papers I have read focus primarily on node features, often neglecting edge attributes. My project requires considering both node and edge attributes for accurate graph generation. Could you provide insights or references to approaches that address this need? What would be the most suitable algorithm for my task? The graphs that I want to generate are not large (less than 500 nodes).

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

1 participant