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

Regarding Runtime Optimization(How divide and conquer algorithm works?) #10

Open
natrajbhargav opened this issue Oct 15, 2024 · 0 comments

Comments

@natrajbhargav
Copy link

Dear Rachel,

I had doubts regarding the divide-and-conquer approach used in the paper for graphs with more than 8000 nodes. Can you please elaborate on the part that after when the nodes are divided and processed in batches containing equal numbers of n type and p type devices, how are the solutions for the batches merged?, i.e. how are the subgraphs having cross edges between the batch partitions handled?

Please reply me...

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