Simplification et partitionnement d'un graphe

Abstract : This document from the fmr group introduces four types of methods for simplifying and/or partitioning graphs. Two methods produce tree-like structures that are easy to visualize: the minimum spanning tree (introduced among other classic methods of path detection), and the nodal regions algorithm (i.e. single or multiple linkage analysis). Two other methods provide groups of nodes characterized by a variety of structures: the filtering of links through a cohesion level based on the proportion of common neighbours of nodes, and the topological decomposition (i.e. looking at links among nodes having similar degree centrality). The application of the two latter methods in geography remains rather limited.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download
Contributor : Laurent Beauguitte <>
Submitted on : Wednesday, March 23, 2011 - 9:02:39 AM
Last modification on : Wednesday, January 22, 2020 - 1:41:35 AM
Long-term archiving on: Friday, June 24, 2011 - 2:34:42 AM


Files produced by the author(s)


  • HAL Id : halshs-00579065, version 1


César Ducruet. Simplification et partitionnement d'un graphe. 2011. ⟨halshs-00579065⟩



Record views


Files downloads