Spanning Tree Construction

Spanning Tree Construction is a distributed algorithmic method that establishes a spanning tree topology in a network by systematically selecting edges to connect all nodes without cycles, enabling efficient message propagation and coordination.

896

Publications

47.5K

Citations

1.8K

Authors

762

Institutions

Publications per year

2017–2026

95

Authors

1.8K

  1. JC
    Jou–Ming Chang

    National Taipei University of Business, Taiwan

    22 publications · 683 citations

    18

    h-index

  2. JY
    Jinn‐Shyong Yang

    National Taipei University of Business, Taiwan

    15 publications · 461 citations

    14

    h-index

  3. JF
    Jianxi Fan

    Soochow University, China

    13 publications · 452 citations

    12

    h-index

  4. DP
    David Peleg

    Weizmann Institute of Science, Israel

    12 publications · 669 citations

    12

    h-index

  5. ME
    Michael Elkin

    Ben-Gurion University of the Negev, Israel

    11 publications · 509 citations

    11

    h-index

1–5 of 1.8K

Venues

  1. SIAM Journal on Computing

    27 publications · 2.7K citations

    22

    h-index

  2. Information Processing Letters

    25 publications · 1.1K citations

    20

    h-index

  3. Discrete Applied Mathematics

    23 publications · 727 citations

    16

    h-index

  4. Journal of Algorithms

    15 publications · 1K citations

    15

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 17 publications · 978 citations

    14

    h-index

1–5