• Aucun résultat trouvé

Dominating sets reconfiguration under token sliding

N/A
N/A
Protected

Academic year: 2021

Partager "Dominating sets reconfiguration under token sliding"

Copied!
18
0
0

Texte intégral

Loading

Figure

Figure 1: Our results: the frontier between PSPACE-completeness and tractability.
Figure 2: Example of TS-sequence from D s to D t .
Figure 3: Graph G 3 .
Figure 4: Example for the reduction of Theorem 4.
+4

Références

Documents relatifs

The fractional chromatic number of a graph G can indeed be defined to be the infimum (which actually is a minimum) of the ratios a/b such that, if every vertex of G is replaced by

3.3.3 Unicyclic graphs with exactly three vertices of maximum degree 3 whose exactly two belongs to the

Given a pencil of algebraic plane curves such that a general element is irreducible, the purpose of this paper is to give a sharp upper bound for the number of reducible curves in

Furthermore, testing the hypothesis that increased SUA still carried increased risk for development of HTN and TOD in “metabolically healthy” subjects, defined in the absence

Comparison between expected phase and estimated phase when the Iris-AO is flat except for the central segment on which a 225 nm piston is applied, in presence of the Lyot

Indeed, as by-products of the pspace -completeness of PML, we show that SL satisfiability [ZL06] is pspace -complete, the fixed- point free fragment of the main logic from [SSMH04]

(c) The normalized transmission intensity (color scale) of the unfocused 800 nm beam as a function of the quarter wave plate (QWP) and polarizer angle in degrees.. (d) The intensity

Mean percentage differences between the monthly sensible cooling energy consumption calculated by an hourly model and that calculated by the correlation, for all