2020
DOI: 10.1016/j.jcss.2020.03.003
|View full text |Cite
|
Sign up to set email alerts
|

Distributed reconfiguration of maximal independent sets

Abstract: In this paper, we investigate a distributed maximal independent set (MIS) reconfiguration problem, in which there are two maximal independent sets for which every node is given its membership status, and the nodes need to communicate with their neighbors in order to find a reconfiguration schedule that switches from the first MIS to the second. Such a schedule is a list of independent sets that is restricted by forbidding two neighbors to change their membership status at the same step. In addition, these inde… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…More recently, [9] designed efficient distributed recoloring for chordal and interval graphs. A few reconfiguration problems different from coloring have been studied in the distributed setting, including vertex cover [12] and maximal independent sets [13].…”
Section: Local Model and Distributed Recoloringmentioning
confidence: 99%
See 1 more Smart Citation
“…More recently, [9] designed efficient distributed recoloring for chordal and interval graphs. A few reconfiguration problems different from coloring have been studied in the distributed setting, including vertex cover [12] and maximal independent sets [13].…”
Section: Local Model and Distributed Recoloringmentioning
confidence: 99%
“…Note that a lower bound result of this flavor can be found in [13] for the problem of maximal independent set reconfiguration but we did not manage to adapt it in our setting.…”
Section: Local Model and Distributed Recoloringmentioning
confidence: 99%