HIERARCHICAL CLUSTERING PHRASED IN GRAPH THEORY: MINIMUM SPANNING TREES, REGIONS OF INFLUENCE, AND DIRECTED TREES.

被引：0
|
作者：
Polanco, Xavier [1 ]
机构：
[1] IU Independent Unit, F-75003 Paris, France
来源：
14TH INTERNATIONAL SOCIETY OF SCIENTOMETRICS AND INFORMETRICS CONFERENCE (ISSI) | 2013年
关键词：
INTERNATIONAL COLLABORATION; LINK INDICATOR; COUNTRIES; SCIENCE;
D O I：
暂无
中图分类号：
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号：
1205 ; 120501 ;
摘要：
引用
收藏
页码：2109 / 2112
页数：4
相关论文
共 49 条
  • [1] Hierarchical clustering in minimum spanning trees
    Yu, Meichen
    Hillebrand, Arjan
    Tewarie, Prejaas
    Meier, Jil
    van Dijk, Bob
    Van Mieghem, Piet
    Stam, Cornelis Jan
    [J]. CHAOS, 2015, 25 (02)
  • [2] CLUSTERING WITH MINIMUM SPANNING TREES
    Zhou, Yan
    Grygorash, Oleksandr
    Hain, Thomas F.
    [J]. INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2011, 20 (01) : 139 - 177
  • [3] Efficiently Computing Directed Minimum Spanning Trees
    Bother, Maximilian
    Kissig, Otto
    Weyand, Christopher
    [J]. 2023 PROCEEDINGS OF THE SYMPOSIUM ON ALGORITHM ENGINEERING AND EXPERIMENTS, ALENEX, 2023, : 86 - 95
  • [4] Updating directed minimum cost spanning trees
    Pollatos, Gerasimos G.
    Telelis, Orestis A.
    Zissimopoulos, Vassilis
    [J]. EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2006, 4007 : 291 - 302
  • [5] Efficiently Computing Directed Minimum Spanning Trees
    Böther, Maximilian
    Kißig, Otto
    Weyand, Christopher
    [J]. Proceedings of the Workshop on Algorithm Engineering and Experiments, 2023, 2023-January : 86 - 95
  • [6] HOMOLOGY THEORY FOR SPANNING TREES OF A GRAPH
    LOVASZ, L
    [J]. ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1977, 30 (3-4): : 241 - 251
  • [7] An algorithm for enumerating all directed spanning trees in a directed graph
    Uno, T
    [J]. ALGORITHMS AND COMPUTATION, 1996, 1178 : 166 - 173
  • [8] A table based algorithm for minimum directed spanning trees
    Feng, J.
    [J]. 2001, Editorial Dept. of Systems Engineering and Electronics (12)
  • [9] ADAPTIVE AND COST-OPTIMAL PARALLEL ALGORITHM FOR MINIMUM SPANNING TREES.
    Akl, S.G.
    [J]. Computing (Vienna/New York), 1986, 36 (03): : 271 - 277
  • [10] A graph-theoretical clustering method based on two rounds of minimum spanning trees
    Zhong, Caiming
    Miao, Duoqian
    Wang, Ruizhi
    [J]. PATTERN RECOGNITION, 2010, 43 (03) : 752 - 766
12345