is_connected_m2

Entiers indiquant deux sommets diff&lt;U+00E9&gt;rents du graphe.

i, j

Matrice carr&lt;U+00E9&gt; d'adjacence. Si on note a_ij l'&lt;U+00E9&gt;l&lt;U+00E9&gt;ment
de cette matrice correspondant &lt;U+00E0&gt; la i&lt;U+00E8&gt;me ligne et j&lt;U+00E8&gt;me colonne, alors
a_ij=0 si les sommets i et j ne sont pas connect&lt;U+00E9&gt;s et sinon a_ij est un entier
qui indique la valeur de l'ar&lt;U+00EA&gt;te entre i et j.

m_graph

v_arete

threshold de confidentialit&lt;U+00E9&gt;.

threshold

Fonction permettant de tester s'il existe un chemin
entre les noeuds i et j o&lt;U+00F9&gt; chaque ar&lt;U+00EA&gt;te a une valeur
plus grande que le threshold de confidentialit&lt;U+00E9&gt; moins
la valeur du lien entre i et j.

An algorithm based on graph theory tools to detect differentiation
problems. A differentiation problem occurs when aggregated
data are disseminated according to two different nomenclatures. By making the
difference for an additive variable X between an aggregate composed of categories
of the first nomenclature and an other aggregate, included in that first
aggregate, composed of categories of the second nomenclature,
it is sometimes possible to derive X on a small aggregate of records
which could then lead to a break of confidentiality.
The purpose of this package is to detect the set of aggregates composed of
categories of the first nomenclature which lead to a differentiation problem,
when given a confidentiality threshold. Reference: Vianney Costemalle (2019) <doi: 10.3233/SJI-190564>.

is_connected_m2: Tester s'il existe un chemin, selon la m<U+00E9>thode 2

Description

Usage

Arguments

Value