Distributed reconfiguration of maximal independent sets
Authors:
- Keren Censor-HillelKCKeren Censor-Hillel
- Mikaël RabieMRMikaël Rabie
- 1 September 2020
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 112, 85-96
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Horizon 2020 (755839)
- Research Council of Finland (285721)
This publication has 10 references indexed in Scilit:
- Local ComputationJournal of the ACM, 2016
- Linear-time algorithm for sliding tokens on treesTheoretical Computer Science, 2015
- Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) TimeSIAM Journal on Computing, 2014
- Symmetry breaking depending on the chromatic number or the neighborhood growthTheoretical Computer Science, 2013
- Complexity of independent set reconfigurability problemsTheoretical Computer Science, 2012
- On the complexity of reconfiguration problemsTheoretical Computer Science, 2011
- On the Complexity of Distributed Network DecompositionJournal of Algorithms, 1996
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986