• Aucun résultat trouvé

Fast Algorithms for min independent dominating set

N/A
N/A
Protected

Academic year: 2021

Partager "Fast Algorithms for min independent dominating set"

Copied!
10
0
0

Texte intégral

Loading

Figure

Figure 1: A multiple branching that can be misleading when dealing with the evaluation of the highest complexity factor.
Figure 2 illustrates the proof of the lemma.
Table 1: Tradeoffs between running times and ratios derived by Propositions 1 and 2.

Références

Documents relatifs

The reason why conflict resolution by FOLLOW set does not work nearly as well as one might wish is that it replaces the look-ahead of single item of rule N in a given LR state

A complex algebraic variety X defined over the real numbers is called an M-variety if the sum of its Betti numbers (for homology with closed supports and coefficients in Z/2)

Une troisième bioéconomie – qui apparaît aujourd’hui dominante dans les discours officiels – correspond à une économie exploitant les différentes formes de biomasse et son

First introduced by Faddeev and Kashaev [7, 9], the quantum dilogarithm G b (x) and its variants S b (x) and g b (x) play a crucial role in the study of positive representations

In order to support both the pupil and the interested teacher, a tool to furnish context- sensitive help for a Mathematical text written in a Braille notation would be desirable. Such

lar than for low values of γ. This is expected since there are fewer nodes with low degree and the degree distribution became more equal. 1 performs the worst by far,

“If we constructed two similar strips, and if we put the second one behind the first one returning it and making correspond 1 cell with 2n cell, it is evident that if Goldbach

Although early lockdown measures and wide testing seem to have helped the goal of flattening the curve [4], the COVID-19 epidemic in Québec entered its second phase when