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

[ENH] Add Bipartite graph generation option to R-MAT #2075

Closed
Tracked by #3527
mughetto opened this issue Feb 15, 2022 · 5 comments
Closed
Tracked by #3527

[ENH] Add Bipartite graph generation option to R-MAT #2075

mughetto opened this issue Feb 15, 2022 · 5 comments
Assignees
@seunghwak
Labels
feature request New feature or request

Comments

@mughetto
Copy link

Sec 3.5 of the R-MAT paper (https://www.cs.cmu.edu/~christos/PUBLICATIONS/siam04.pdf) documents an option for generating a bipartite graph by specifying the number of node on each dimension.

As far as I can tell this is not doable with the current implementation (that assumes square adjacency).

Is it something that could be easily added?
@mughetto mughetto added the ? - Needs Triage Need team to review and classify label Feb 15, 2022
@BradReesWork
Copy link
Member

@mughetto we can do that. We plan to be expanding the number of generators and options. I will work this into our roadmap

@mughetto
Copy link
Author

Great to hear! Looking forward to it!

@rapidsai rapidsai deleted a comment from github-actions bot Sep 29, 2022
@rapidsai rapidsai deleted a comment from github-actions bot Sep 29, 2022
@BradReesWork BradReesWork added feature request New feature or request and removed ? - Needs Triage Need team to review and classify inactive-30d labels Sep 29, 2022
@BradReesWork BradReesWork added this to the 22.12 milestone Sep 29, 2022
@ChuckHastings ChuckHastings removed this from the 22.12 milestone Nov 28, 2022
@seunghwak seunghwak mentioned this issue Apr 25, 2023
Merged
rapids-bot bot pushed a commit that referenced this issue May 1, 2023
@seunghwak
Bipartite R-mat graph generation. (#3512)
e271bad 
Addresses #2075

This function will generate (source, destination) vertex ID pairs. Source vertex IDs will have values in `[0, 2^src_scale)` and destination vertex IDs will have values in `[0, 2^dst_scale)`.

Additionally,

* `scramble_vertex_ids` function had unused input parameters and it was internally erroneously setting scale. Fixed this bug.

* Rmat_Usecase was ignoring scramble_vertex_ids flag, fixed this bug.

* Added `scramble_vertex_ids` that take a just single vertex list (instead of src, dst pair)

* Update `scramble_vertex_ids` to take input vectors as R-values and return scrambled vectors (instead taking in/out parameters)

Authors:
  - Seunghwa Kang (https://github.com/seunghwak)

Approvers:
  - Naim (https://github.com/naimnv)
  - Chuck Hastings (https://github.com/ChuckHastings)
  - Brad Rees (https://github.com/BradReesWork)

URL: #3512
@BradReesWork
Copy link
Member

@rlratzel time to get Python wrappers

This was referenced May 1, 2023
Open
Closed
@ChuckHastings
Copy link
Collaborator

@rlratzel @BradReesWork - Created an epic to track this along with some companion stories. Please review.

@BradReesWork
Copy link
Member

Being tracked under this new Epic: #2075

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

@seunghwak seunghwak

Labels
feature request New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
4 participants
@mughetto @BradReesWork @ChuckHastings @seunghwak