EFFICIENT ALGORITHMS FOR FINDING MINIMUM SPANNING FORESTS OF HIERARCHICALLY DEFINED GRAPHS

被引:20
|
作者
LENGAUER, T [1 ]
机构
[1] UNIV GESAMTHSCH PADERBORN,FACHBEREICH 17,D-4790 PADERBORN,FED REP GER
关键词
D O I
10.1016/0196-6774(87)90042-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:260 / 284
页数:25
相关论文
共 50 条
  • [31] A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
    Bader, David A.
    Burkhardt, Paul
    Journal of Graph Algorithms and Applications, 2022, 26 (04): : 577 - 588
  • [32] PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
    HSU, LH
    WANG, PF
    WU, CT
    PARALLEL COMPUTING, 1992, 18 (10) : 1143 - 1155
  • [33] PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
    HSU, LH
    WANG, PF
    WU, CT
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 284 - 290
  • [34] Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs
    Luo, Mao
    Qin, Huigang
    Wu, Xinyun
    Xiong, Caiquan
    Xia, Dahai
    Ke, Yuanzhi
    MATHEMATICS, 2024, 12 (07)
  • [35] EFFICIENT ALGORITHMS FOR FINDING MAXIMUM MATCHING IN GRAPHS.
    Galil, Zvi
    Computing surveys, 1986, 18 (01): : 23 - 38
  • [37] Efficient algorithms for the minimum connected domination on trapezoid graphs
    Tsai, Yin-Te
    Lin, Yaw-Ling
    Hsu, F. R.
    INFORMATION SCIENCES, 2007, 177 (12) : 2405 - 2417
  • [38] Efficient algorithms for the minimum connected domination on trapezoid graphs
    Lin, YL
    Hsu, FR
    Tsai, YT
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 126 - 136
  • [39] AUGMENTATION PROBLEMS ON HIERARCHICALLY DEFINED GRAPHS
    FERNANDEZBACA, D
    WILLIAMS, MA
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 382 : 563 - 576
  • [40] PARALLEL ALGORITHMS FOR FINDING STEINER FORESTS IN PLANAR GRAPHS (A PRELIMINARY VERSION)
    SUZUKI, H
    YAMANAKA, C
    NISHIZEKI, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 : 458 - 467