Distributed Reconfiguration of Maximal Independent Sets
From MaRDI portal
Recommendations
- Distributed reconfiguration of maximal independent sets
- An Improved Distributed Algorithm for Maximal Independent Set
- Distributed Maximal Independent Set using Small Messages
- Optimal dynamic distributed MIS
- A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Cites work
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- An Improved Distributed Algorithm for Maximal Independent Set
- Complexity of independent set reconfigurability problems
- Distributed \((\Delta+1)\)-coloring in linear (in \(\Delta\)) time
- Distributed recoloring
- Linear-time algorithm for sliding tokens on trees
- Local computation: lower and upper bounds
- Locality in Distributed Graph Algorithms
- Locally-iterative distributed \((\Delta+1)\)-coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models
- On the Complexity of Distributed Network Decomposition
- On the complexity of reconfiguration problems
- Super-fast 3-ruling sets
- Symmetry breaking depending on the chromatic number or the neighborhood growth
- Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets
- The complexity of change
- The complexity of independent set reconfiguration on bipartite graphs
Cited in
(4)
This page was built for publication: Distributed Reconfiguration of Maximal Independent Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092338)
