software . 2016

RéSo

Barnier, Julien; Dalud-Vincent, M.;
Open Access English
  • Published: 01 Jan 2016
  • Publisher: HAL CCSD
  • Country: France
Abstract
RéSo proposes a decomposition of each (strongly) connected component of a graph. Its use is justified for researching center (s) / periphery (ies). It proceeds by classifying in successive layers of "fragile points" the vertices of each component. When no more fragile points appear, it classifies together the so-called "order 1" points of articulation that make the link between the different peripheries and the more central part, i.e. the vertices that guarantee continuity with the vertices in the margin. Then Reso repeats the search for peripheries ... This work continues until there are no more vertices in the component or until no vertice can be classified in...
Subjects
free text keywords: points of articulation, fragile points, center(s)/periphery(ies), decomposition of a network, (strongly) connected component, décomposition d'un réseau, centre(s)/périphérie(s), composante (fortement) connexe, points fragiles, points d'articulation, [SHS.SOCIO]Humanities and Social Sciences/Sociology
Related Organizations
Download from
HAL-ENS-LYON
Software . 2016
Any information missing or wrong?Report an Issue