Efficiently Computing Directed Minimum Spanning Trees

被引：0
|
作者：
Böther, Maximilian [1 ]
Kißig, Otto [2 ]
Weyand, Christopher [3 ]
机构：
[1] Eth Zurich, Switzerland
[2] Hasso Plattner Institute, Germany
[3] Karlsruhe Institute of Technology, Germany
来源：
Proceedings of the Workshop on Algorithm Engineering and Experiments | 2023年 / 2023-January卷
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
下载
收藏
页码：86 / 95
相关论文
共 50 条
  • [1] Efficiently Computing Directed Minimum Spanning Trees
    Bother, Maximilian
    Kissig, Otto
    Weyand, Christopher
    2023 PROCEEDINGS OF THE SYMPOSIUM ON ALGORITHM ENGINEERING AND EXPERIMENTS, ALENEX, 2023, : 86 - 95
  • [2] Computing minimum spanning trees with uncertainty
    Erlebach, Thomas
    Hoffmann, Michael
    Krizanc, Danny
    Mihal'ak, Matus
    Raman, Rajeev
    STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 277 - +
  • [3] Updating directed minimum cost spanning trees
    Pollatos, Gerasimos G.
    Telelis, Orestis A.
    Zissimopoulos, Vassilis
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2006, 4007 : 291 - 302
  • [4] A table based algorithm for minimum directed spanning trees
    Feng, J.
    2001, Editorial Dept. of Systems Engineering and Electronics (12)
  • [5] Computing Minimum Dilation Spanning Trees in Geometric Graphs
    Brandt, Alex F.
    Gaiowski, Miguel F. A. de M.
    de Rezende, Pedro J.
    de Souza, Cid C.
    COMPUTING AND COMBINATORICS, 2015, 9198 : 297 - 309
  • [6] A simple algorithm for computing minimum spanning trees in the Internet
    AbdelWahab, H
    Stoica, I
    Sultan, F
    Wilson, K
    INFORMATION SCIENCES, 1997, 101 (1-2) : 47 - 69
  • [7] A PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING-TREES
    JOHNSON, DB
    METAXAS, P
    JOURNAL OF ALGORITHMS, 1995, 19 (03) : 383 - 401
  • [8] A Fast Graph Program for Computing Minimum Spanning Trees
    Courtehoute, Brian
    Plump, Detlef
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2020, (330): : 163 - 180
  • [9] Computing phylogenetic trees using topologically related minimum spanning trees
    Kalaghatgi P.
    Lengauer T.
    1600, Brown University (21): : 1003 - 1025
  • [10] A DISTRIBUTED ALGORITHM FOR MINIMUM WEIGHT DIRECTED SPANNING-TREES
    HUMBLET, PA
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (06) : 756 - 762
12345