DyGMIS: Fast and Scalable Fully Dynamic MIS Maintenance on Large Evolving Graphs
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...