EFFICIENT ALGORITHM FOR PARTITIONING OF TREES

被引:48
|
作者
LUKES, JA [1 ]
机构
[1] IBM CORP,SYST DEV DIV LAB,SKYPORT DR,SAN JOSE,CA 95114
关键词
D O I
10.1147/rd.183.0217
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper describes an algorithm for partitioning a graph that is in the form of a tree. The algorithm has a growth in computation time and storage requirements that is directly proportional to the number of nodes in the tree. Several applications of the algorithm are briefly described. In particular it is shown that the tree partitioning problem frequently arises in the allocation of computer information to blocks of storage. Also, a heuristic method of partitioning a general graph based on this algorithm is suggested.
引用
收藏
页码:217 / 224
页数:8
相关论文
共 50 条
  • [31] AN EFFICIENT AND EFFECTIVE PARTITIONING ALGORITHM FOR AIR TRAFFIC MANAGEMENT
    Paul, Bjoern
    Himmelspach, Jan
    Theeck, Wolfgang
    Uhrmacher, Adelinde
    INTERNATIONAL MEDITERRANEAN MODELLING MULTICONFERENCE 2006, 2006, : 373 - 378
  • [32] EFFICIENT ALGORITHM FOR GENERALIZED POLYNOMIAL PARTITIONING AND ITS APPLICATIONS
    Agarwal, Pankaj K.
    Aronov, Boris
    Ezra, Esther
    Zahl, Joshua
    SIAM JOURNAL ON COMPUTING, 2021, 50 (02) : 760 - 787
  • [33] PARTITIONING PRODUCTS OF TREES
    HALPERN, JD
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (05): : A513 - A513
  • [34] Partitioning infinite trees
    Horak, P
    Heinrich, K
    JOURNAL OF GRAPH THEORY, 2000, 34 (02) : 113 - 127
  • [35] Partitioning of biweighted trees
    Agnetis, A
    Mirchandani, PB
    Pacifici, A
    NAVAL RESEARCH LOGISTICS, 2002, 49 (02) : 143 - 158
  • [36] Throughfall partitioning by trees
    Levia, Delphis F.
    Nanko, Kazuki
    Amasaki, Hiromasa
    Giambelluca, Thomas W.
    Hotta, Norifumi
    Iida, Shin'ichi
    Mudd, Ryan G.
    Nullet, Michael A.
    Sakai, Naoki
    Shinohara, Yoshinori
    Sun, Xinchao
    Suzuki, Masakazu
    Tanaka, Nobuaki
    Tantasirin, Chatchai
    Yamada, Kozo
    HYDROLOGICAL PROCESSES, 2019, 33 (12) : 1698 - 1708
  • [37] Partitioning by monochromatic trees
    Haxell, PE
    Kohayakawa, Y
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1996, 68 (02) : 218 - 222
  • [38] An efficient metric combinatorial algorithm for fitting additive trees
    Corter, JE
    MULTIVARIATE BEHAVIORAL RESEARCH, 1998, 33 (02) : 249 - 271
  • [39] A new, fast, and efficient image codec based on set partitioning in hierarchical trees
    Said, A
    Pearlman, WA
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 1996, 6 (03) : 243 - 250
  • [40] Efficient search algorithm on compact S-trees
    Chung, KL
    Wu, JG
    Lan, JK
    PATTERN RECOGNITION LETTERS, 1997, 18 (14) : 1427 - 1434