Vertex partitioning of a class of digraphs

Mathématiques et sciences humaines. Mathematics and social sciences

Ferre, Louis¹  Jouve, Bertrand¹ 

关键词: dissimilarity;    hierarchical clustering;    partitioning of a digraph;    small worlds graph;   

DOI  :  10.4000/msh.2857

学科分类：数学（综合）

来源: College de France * Ecole des Hautes Etudes en Sciences Sociales (E H E S S)

【 摘 要 】

A vertex subset V' of a digraph is a pseudo sink set if its out-degree is low. The research of a pseudo sink set in a digraph is a high complexity combinatory problem. We show, for a particular family of digraphs, that a clustering of the vertex set fitted with a well chosen metric allows to reveal pseudo sink sets by their aggregation in a first level.

【 授权许可】

Unknown