DyGMIS: Fast and Scalable Fully Dynamic MIS Maintenance on Large Evolving Graphs
Open Access
- 27 September 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 337-347
Abstract
No abstract availableThis publication has 32 references indexed in Scilit:
- Parallel Katz Centrality On Evolving Graphs2024
- Fast MIS on Incremental Graphs2024
- Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time2019
- Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time2019
- cuSTINGER: Supporting dynamic graph algorithms for GPUs2016
- Synchronization Trade-Offs in GPU Implementations of Graph Algorithms2016
- Graph coloring algorithms for multi-core and massively multithreaded architecturesParallel Computing, 2012
- STINGER: High performance data structure for streaming graphs2012
- Community structure in social and biological networksProceedings of the National Academy of Sciences, 2002
- An Incremental Algorithm for a Generalization of the Shortest-Path ProblemJournal of Algorithms, 1996