Concepedia

Kruskal's Algorithm

Kruskal's Algorithm is a minimum spanning tree algorithm that belongs to the class of greedy graph algorithms, distinguished by its use of the disjoint set union data structure to efficiently manage and merge disjoint components while selecting edges in increasing order of weight to construct an optimal spanning tree.

69

Publications

3.9K

Citations

167

Authors

86

Institutions

Publications per year

2017–2026

14

Parents

Publications

69

On the History of the Minimum Spanning Tree Problem

Ronald Graham, Pavol Hell · IEEE Annals of the History of Computing · 1985 · 812 citations

, , +8

An upper bound for the probability of a union

D. B. Hunter · Journal of Applied Probability · 1976 · 313 citations

, , +15

Edge sets: an effective evolutionary coding of spanning trees

Günther R. Raidl, Bryant A. Julstrom · IEEE Transactions on Evolutionary Computation · 2003 · 284 citations

, , +16

Optimum Communication Spanning Trees

T. C. Hu · SIAM Journal on Computing · 1974 · 268 citations

, , +17

Spanning trees and optimization problems

Choice Reviews Online · 2004 · 238 citations

, , +16

1–5 of 69

Authors

167

  1. AK
    Aaron Kershenbaum

    SUNY Polytechnic Institute, United States

    4 publications · 212 citations

    4

    h-index

  2. BA
    Bryant A. Julstrom

    St. Cloud State University, United States

    3 publications · 333 citations

    3

    h-index

  3. GR
    Günther R. Raidl

    TU Wien, Austria

    3 publications · 333 citations

    3

    h-index

  4. RR
    R. Ravi

    Carnegie Mellon University, United States

    2 publications · 98 citations

    2

    h-index

  5. IC
    I-Che Chen

    Research Center for Information Technology Innovation, Academia Sinica, Taiwan

    2 publications · 56 citations

    2

    h-index

1–5 of 167

Institutions

86

  1. TU Wien

    Vienna, Austria

    3 h-index

    4 publications

    366 citations

  2. St. Cloud State University

    Saint Cloud, United States

    3 h-index

    3 publications

    333 citations

  3. University of Groningen

    Groningen, The Netherlands

    2 h-index

    3 publications

    253 citations

  4. Shanghai Jiao Tong University

    Shanghai, China

    2 h-index

    8 publications

    180 citations

  5. National Cheng Kung University

    Tainan City, Taiwan

    2 h-index

    2 publications

    56 citations

  6. Simon Fraser University

    Burnaby, Canada

    2 h-index

    2 publications

    824 citations

  7. Shanghai University

    Shanghai, China

    2 h-index

    5 publications

    76 citations

  8. University of Bonn

    Bonn, Germany

    2 h-index

    2 publications

    56 citations

1–8 of 86

Venues

  1. Linear Algebra and its Applications

    3 publications · 285 citations

    3

    h-index

  2. Networks

    3 publications · 95 citations

    3

    h-index

  3. Journal of Applied Probability

    JAP · 2 publications · 349 citations

    2

    h-index

  4. SIAM Journal on Computing

    2 publications · 312 citations

    2

    h-index

  5. Mathematical Problems in Engineering

    MPE · 2 publications · 26 citations

    2

    h-index

1–5