共 50 条
- [41] Fully Dynamic Maximal Independent Set in Polylogarithmic Update Time 2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 382 - 405
- [43] A randomized BSP/CGM algorithm for the maximal independent set problem FOURTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN'99), PROCEEDINGS, 1999, : 284 - 289
- [47] A Note on the Approximation of a Minimum-Weight Maximal Independent Set Computational Optimization and Applications, 1999, 14 : 157 - 169
- [49] Fully Dynamic Maximal Independent Set with Sublinear Update Time STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 815 - 826
- [50] Algorithms for k-colouring and finding maximal independent sets PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 456 - 457