Finding a Maximal Independent Set (MIS) in a graph is a fundamental combinatorial problem. Maintaining an MIS over large dynamic graphs is challenging as recomputation from scratch is expensive, and existing dynamic approaches either process updates sequentially or introduce costly synchronization to handle concurrent...
Prajjwal Nijhara, Agam Harpreet Singh, Aditya Trivedi et al.· Proceedings of the Internati...· 0 citations
ExCC is presented, an external-memory CC algorithm that keeps the full graph in host-pinned RAM and streams edge batches to the GPU through a three-phase pipeline of union-find merging and achieves predictable sequential I/O behavior across all phases.
Prajjwal Nijhara, D. Banerjee· IEEE International Symposium...· 0 citations
This work presents SAGA, a high-performance framework for real-time combinatorial optimization on dynamic graphs that adopts a state-aware execution model in which each vertex maintains compact local state, enabling incremental and localized updates in response to graph changes.
Rohit Prajapati, Prajjwal Nijhara, D. Banerjee· IEEE International Symposium...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
