1 Search Results for "Joffard, Alice"

Document

DOI: 10.4230/LIPIcs.ISAAC.2020.37

Linear Transformations Between Dominating Sets in the TAR-Model

Authors: Nicolas Bousquet, Alice Joffard, and Paul Ouvrard

Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)

Abstract

Given a graph G and an integer k, a token addition and removal (TAR for short) reconfiguration sequence between two dominating sets D_s and D_t of size at most k is a sequence S = ⟨ D₀ = D_s, D₁ …, D_𝓁 = D_t ⟩ of dominating sets of G such that any two consecutive dominating sets differ by the addition or deletion of one vertex, and no dominating set has size bigger than k. We first improve a result of Haas and Seyffarth [R. Haas and K. Seyffarth, 2017], by showing that if k = Γ(G)+α(G)-1 (where Γ(G) is the maximum size of a minimal dominating set and α(G) the maximum size of an independent set), then there exists a linear TAR reconfiguration sequence between any pair of dominating sets. We then improve these results on several graph classes by showing that the same holds for K_𝓁-minor free graph as long as k ≥ Γ(G)+O(𝓁 √(log 𝓁)) and for planar graphs whenever k ≥ Γ(G)+3. Finally, we show that if k = Γ(G)+tw(G)+1, then there also exists a linear transformation between any pair of dominating sets.

Cite as

Nicolas Bousquet, Alice Joffard, and Paul Ouvrard. Linear Transformations Between Dominating Sets in the TAR-Model. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 37:1-37:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{bousquet_et_al:LIPIcs.ISAAC.2020.37,
  author =	{Bousquet, Nicolas and Joffard, Alice and Ouvrard, Paul},
  title =	{{Linear Transformations Between Dominating Sets in the TAR-Model}},
  booktitle =	{31st International Symposium on Algorithms and Computation (ISAAC 2020)},
  pages =	{37:1--37:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-173-3},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{181},
  editor =	{Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.37},
  URN =		{urn:nbn:de:0030-drops-133812},
  doi =		{10.4230/LIPIcs.ISAAC.2020.37},
  annote =	{Keywords: reconfiguration, dominating sets, addition removal, connectivity, diameter, minor, treewidth}
}

Refine by Author
1 Bousquet, Nicolas
1 Joffard, Alice
1 Ouvrard, Paul

Refine by Classification
1 Mathematics of computing → Graph algorithms

Refine by Keyword
1 addition removal
1 connectivity
1 diameter
1 dominating sets
1 minor
Show More...

Refine by Type
1 document

Refine by Publication Year
1 2020

1 Search Results for "Joffard, Alice"

Linear Transformations Between Dominating Sets in the TAR-Model

Abstract

Cite as

Thanks for your feedback!

Could not send message