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
896
A fast algorithm for Steiner trees
Lawrence T. Kou, George Markowsky, L. Berman · Acta Informatica · 1981 · 1.2K citations
1–5 of 896
1.8K
18
h-index
14
h-index
12
h-index
12
h-index
11
h-index
1–5 of 1.8K
762
National Taipei University of Business
Taipei, Taiwan
18 h-index
44 publications
1.3K citations

Soochow University
Suzhou, China
15 h-index
46 publications
1.5K citations
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
19 publications
1.6K citations
National Tsing Hua University
Hsinchu, Taiwan
13 h-index
24 publications
1.4K citations
IBM (United States)
Armonk, United States
13 h-index
20 publications
1.3K citations

Tel Aviv University
Tel Aviv, Israel
13 h-index
20 publications
1.1K citations

Weizmann Institute of Science
Rehovot, Israel
12 h-index
17 publications
707 citations

University of Waterloo
Waterloo, Canada
11 h-index
19 publications
1.1K citations
1–8 of 762
27 publications · 2.7K citations
22
h-index
25 publications · 1.1K citations
20
h-index
23 publications · 727 citations
16
h-index
15 publications · 1K citations
15
h-index
TPDS · 17 publications · 978 citations
14
h-index
1–5