You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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...
The text was updated successfully, but these errors were encountered:
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...
The text was updated successfully, but these errors were encountered: