Log in

Relevant bibliographies by topics / Kruskal’s algorithm

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers
Reports

Academic literature on the topic 'Kruskal’s algorithm'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Kruskal’s algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Kruskal’s algorithm"

1

Sarvade, Akanksha. "Analysis between Prims and Kruskal’s Algorithm." International Journal for Research in Applied Science and Engineering Technology 12, no. 11 (2024): 2464–67. https://doi.org/10.22214/ijraset.2024.65593.

Full text

Abstract:

The project is an analytical comparison between two algorithms that is Prim’s algorithm and Kruskal’s algorithm in MST (minimum spanning tree). Both the algorithms aim to connect all the vertices based on their weight but differ in implementation and approach. Prim’s algorithm is Greedy algorithm which makes the minimum spanning tree according to their incremental weight It starts with one vertex and expands its MST, it always selects smallest edge in MST. Kruskal’s algorithm is also greedy algorithm but its approaches differently. It starts with all the vertices and no edge and it adds edge w

APA, Harvard, Vancouver, ISO, and other styles

2

Marpaung, Faridawaty, Arnita Arnita, and Wirdatull Jannah Idris. "COMPERATIVE OF PRIM’S, KRUSKAL’S AND BORUVKA’S ALGORITMA TO SOLVE MINIMUM SPANNING TREE PROBLEMS." Jurnal Handayani 10, no. 2 (2019): 80. http://dx.doi.org/10.24114/jh.v10i2.16053.

Full text

Abstract:

Abstract. Optimization is important in an algorithm. It can save the operational costs of an activity. In the Minimum Spanning Tree, the goal is to achieve how all vertices are connected with the smallest weights. Several algorithms can calculate the use of weights in this. The purpose of this study is to find out the Primary electricity distribution network graph model and correct algorithm to determine the minimum spanning tree. By comparing three algorithms, Prim’s, Boruvka’s and Kruskal’s algorithm, it will get an efficient algorithm to solve the minimum spanning tree problem. To get the o

APA, Harvard, Vancouver, ISO, and other styles

3

Aissa, Mohamed, Adel Ben Mnaouer, Rion Murray, and Abdelfettah Belghith. "New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing." International Journal of Business Data Communications and Networking 7, no. 4 (2011): 32–51. http://dx.doi.org/10.4018/jbdcn.2011100103.

Full text

Abstract:

Multimedia applications are expected to guarantee end-to-end quality of service (QoS) and are characterized by stringent constraints on delay, delay-jitter, bandwidth, cost, and so forth. The authors observe that Kruskal’s algorithm is limited to minimal (maximal) spanning unconstrained tree. As such, the authors extend Kruskal’s algorithm to incorporate the delay bound constraint. Consequently, a novel algorithm is proposed, called EKRUS (Extended Kruskal), for constructing multicast trees. The EKRUS’ distinguishing features consists of a better management of Kruskal’s priority queues, and in

APA, Harvard, Vancouver, ISO, and other styles

4

Paryati and Krit Salahddine. "The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph." MATEC Web of Conferences 348 (2021): 01001. http://dx.doi.org/10.1051/matecconf/202134801001.

Full text

Abstract:

Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins. In the Kruskal algorithm, ordering the weight of the ribs makes it easy to find the shortest path. This algorithm is independent in nature which will facilitate and improve path creation. Based on the results of the application system trials that have been carried out in testing and comparisons between the Kruskal algorithm and the Dijkstra algorithm, the following conclusions can be drawn: that a strength that is the e

APA, Harvard, Vancouver, ISO, and other styles

5

Paryati and Krit Salahddine. "The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph." E3S Web of Conferences 297 (2021): 01062. http://dx.doi.org/10.1051/e3sconf/202129701062.

Full text

Abstract:

Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins. In the Kruskal algorithm, ordering the weight of the ribs makes it easy to find the shortest path. This algorithm is independent in nature which will facilitate and improve path creation. Based on the results of the application system trials that have been carried out in testing and comparisons between the Kruskal algorithm and the Dijkstra algorithm, the following conclusions can be drawn: that a strength that is the e

APA, Harvard, Vancouver, ISO, and other styles

6

Broutin, Nicolas, Luc Devroye, and Erin McLeish. "Note on the Structure of Kruskal’s Algorithm." Algorithmica 56, no. 2 (2008): 141–59. http://dx.doi.org/10.1007/s00453-008-9164-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Boldovs, Igors, Jurijs Vinogradovs, and Pēteris Grabusts. "COMPARISON OF MAZE GENERATION ALGORITHMS." HUMAN. ENVIRONMENT. TECHNOLOGIES. Proceedings of the Students International Scientific and Practical Conference, no. 20 (April 20, 2016): 40–43. http://dx.doi.org/10.17770/het2016.20.3508.

Full text

Abstract:

The author in this work provides insight into the Maze generation. Themes which are discussed are Eller’s algorithm, Kruskal’s algorithm and Recursive backtracking algorithm. All this algorithms were compared.

APA, Harvard, Vancouver, ISO, and other styles

8

Kamyab, Gholam-Reza. "Optimal Feeder Routing and DG Placement Using Kruskal’s Algorithm." European Journal of Electrical Engineering 22, no. 1 (2020): 71–78. http://dx.doi.org/10.18280/ejee.220109.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mohamad, Hasmaini, Wan Iqmal Faezy Wan Zalnidzham, Nur Ashida Salim, Shahrani Shahbudin, and Zuhaila Mat Yasin. "Power system restoration in distribution network using minimum spanning tree - Kruskal’s algorithm." Indonesian Journal of Electrical Engineering and Computer Science 16, no. 1 (2019): 1. http://dx.doi.org/10.11591/ijeecs.v16.i1.pp1-8.

Full text

Abstract:

<span>Events such as natural and manmade interference, line, transformer and feeder outages that occur in electric power distribution system negatively impact the continuity of power supply, thus affecting the power demand supply as well as customer’s satisfaction. In that cases, the restoration of power needs to be carried out immediately in order to guarantee the system’s reliability. The power flow path identification is considered as a difficult task especially in a huge system due to large number of switches. Kruskal’s algorithm is presented in this paper to find the minimum power f

APA, Harvard, Vancouver, ISO, and other styles

10

Natarajan, Gowrishankar Subramaniam, R. Krishnaveni, and Frank J. Vijay. "Software Defined Networking (SDN) Based Video Service Using Djikstra’s Algorithm and Kruskal’s Algorithm." Journal of Computational and Theoretical Nanoscience 14, no. 9 (2017): 4539–44. http://dx.doi.org/10.1166/jctn.2017.6806.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Kruskal’s algorithm"

1

Bini, Tarcizio Alexandre. "Aplicação do algoritmo de Kruskal na otimização de consultas com múltiplas junções relacionais." reponame:Repositório Institucional da UFPR, 2009. http://hdl.handle.net/1884/19476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Stráník, František. "Teorie grafů - implementace vybraných problémů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218082.

Full text

Abstract:

This work is intended on identification with basic problems from the graphs theory area. There are the basic conceptions as well more complicated problems described. The one part of this work is specialized in working of individual types of graphs. It starts with single linked list through double linked list after as much as trees which represented the simplest graphs textures. The other part of this work devotes to the whole graph and describes more complicated problems and their resolution from the theory graphs area. Among these problems belongs to searching in graphs help by Depth First Se

APA, Harvard, Vancouver, ISO, and other styles

3

Dore, Lucia. "Matroidi e Algoritmo Greedy." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20798/.

Full text

Abstract:

Il primo capitolo di questa trattazione presenta nove differenti definizioni assiomatiche di matroide, che si dimostrano essere equivalenti attraverso il concetto di criptomorfismo. Nel secondo capitolo andremo a studiare le matroidi grafiche come esempio di matroidi. Col termine ‘matroide grafica’ indichiamo la struttura assunta da un grafo che si verifica soddisfare i vari sistemi assiomatici introdotti nel capitolo precedente. Un’attenzione particolare è data al Polinomio di Tutte, nato come oggetto definito per i grafi ed esteso successivamente alle matroidi. L’ultimo capitolo vede invece

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Kruskal’s algorithm"

1

Mohan, Anshuman, Wei Xiang Leow, and Aquinas Hobor. "Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms." In Computer Aided Verification. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_37.

Full text

Abstract:

AbstractWe develop machine-checked verifications of the full functional correctness of C implementations of the eponymous graph algorithms of Dijkstra, Kruskal, and Prim. We extend Wang et al.’s CertiGraph platform to reason about labels on edges, undirected graphs, and common spatial representations of edge-labeled graphs such as adjacency matrices and edge lists. We certify binary heaps, including Floyd’s bottom-up heap construction, heapsort, and increase/decrease priority.Our verifications uncover subtle overflows implicit in standard textbook code, including a nontrivial bound on edge wei

APA, Harvard, Vancouver, ISO, and other styles

2

Chakrabarty, Maitrayee, and Dipu Sarkar. "Optimal Energy Restoration in Radial Distribution: A Network Reconfiguration Approach by Kruskal’s Minimal Spanning Tree Algorithm." In Lecture Notes in Networks and Systems. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-8451-0_51.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Righini, Ermanno, and Giovanni Righini. "The Skewed Kruskal Algorithm." In Lecture Notes in Computer Science. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-24866-5_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Lei, Bo Wu, and Jupu Yuan. "Kruskal Algorithm for Construction Network Diagram." In Application of Intelligent Systems in Multi-modal Information Analytics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-74814-2_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Osipov, Vitaly, Peter Sanders, and Johannes Singler. "The Filter-Kruskal Minimum Spanning Tree Algorithm." In 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611972894.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Najman, Laurent, Jean Cousty, and Benjamin Perret. "Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38294-9_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zambrano-Restrepo, Juan Manuel, Nelson Javier Tovar-Perilla, Luz Adriana Sanchez-Echeverri, and Laura Patricia Carranza-Murillo. "Optimization of Routes for Covered Walkways at University Campus by Kruskal Algorithm." In Communications in Computer and Information Science. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-20611-5_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lyu, Chenzhong. "Evaluation of Agricultural Economic Information Based on Kruskal Algorithm and Principal Component Analysis." In Lecture Notes in Electrical Engineering. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-9538-7_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

"Kruskal’s Algorithm." In Encyclopedia of Operations Research and Management Science. Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_200370.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Aissa, Mohamed, Adel Ben Mnaouer, Rion Murray, and Abdelfettah Belghith. "New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing." In Web-Based Multimedia Advancements in Data Communications and Networking Technologies. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2026-1.ch015.

Full text

Abstract:

Multimedia applications are expected to guarantee end-to-end quality of service (QoS) and are characterized by stringent constraints on delay, delay-jitter, bandwidth, cost, and so forth. The authors observe that Kruskal’s algorithm is limited to minimal (maximal) spanning unconstrained tree. As such, the authors extend Kruskal’s algorithm to incorporate the delay bound constraint. Consequently, a novel algorithm is proposed, called EKRUS (Extended Kruskal), for constructing multicast trees. The EKRUS’ distinguishing features consists of a better management of Kruskal’s priority queues, and in

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Kruskal’s algorithm"

1

Gupta, Sakshi, Archit Mahajan, Sneha Shah, and Variza Negi. "Exploring the Maze: A Comparative Study of Prims and Kruskals MST Algorithms." In 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT). IEEE, 2024. http://dx.doi.org/10.1109/icccnt61001.2024.10726020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kalarani, P., and R. Revathi. "Modular Multiplicative Divisor Labeling Techniques for Efficient Minimum Spanning Tree Computation in Jellyfish Graph Using Kruskal Algorithm." In 2025 Fifth International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT). IEEE, 2025. https://doi.org/10.1109/icaect63952.2025.10958982.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Deng, Junyong, Baoxiang Zhang, Xiaoliang Fu, Xiaoyan Xie, Jingwen Deng, and Zekun Ye. "Mr_Kru: Accelerator of Kruskal’s Algorithm for Finding Root Node in Parallel." In 2022 7th International Conference on Integrated Circuits and Microsystems (ICICM). IEEE, 2022. http://dx.doi.org/10.1109/icicm56102.2022.10011371.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Guttoski, Pryscila Barvik, Marcos Sfair Sunye, and Fabiano Silva. "Kruskal's Algorithm for Query Tree Optimization." In 11th International Database Engineering and Applications Symposium (IDEAS 2007). IEEE, 2007. http://dx.doi.org/10.1109/ideas.2007.4318118.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sudhakar, T. D., and K. N. Srinivas. "Power system restoration based on Kruskal's algorithm." In 2011 1st International Conference on Electrical Energy Systems (ICEES). IEEE, 2011. http://dx.doi.org/10.1109/icees.2011.5725343.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Berger, Raoul, Severine Dubuisson, and Christophe Gonzales. "Fast multiple histogram computation using Kruskal's algorithm." In 2012 19th IEEE International Conference on Image Processing (ICIP 2012). IEEE, 2012. http://dx.doi.org/10.1109/icip.2012.6467374.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Aissa, Mohamed, Adel Ben Mnaouer, and Abdelfettah Belghith. "A novel extension of Kruskal's algorithm in multicast routing." In 2009 IEEE 34th Conference on Local Computer Networks (LCN 2009). IEEE, 2009. http://dx.doi.org/10.1109/lcn.2009.5355090.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Katsigiannis, Anastasios, Nikos Anastopoulos, Konstantinos Nikas, and Nectarios Koziris. "An Approach to Parallelize Kruskal's Algorithm Using Helper Threads." In 2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2012. http://dx.doi.org/10.1109/ipdpsw.2012.201.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sayata, Umang B., and N. P. Desai. "An algorithm for Hierarchical Chinese postman problem using minimum spanning tree approach based on Kruskal's algorithm." In 2015 IEEE International Advance Computing Conference (IACC). IEEE, 2015. http://dx.doi.org/10.1109/iadcc.2015.7154702.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Pan, Da-Zhi, Zhi-Bin Liu, Xian-Feng Ding, and Qin Zheng. "The Application of Union-Find Sets in Kruskal Algorithm." In 2009 International Conference on Artificial Intelligence and Computational Intelligence. IEEE, 2009. http://dx.doi.org/10.1109/aici.2009.155.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Kruskal’s algorithm"

1

Striuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4462.

Full text

Abstract:

The paper presents an analysis of the importance of studying graph algorithms, the reasons for the need to implement this project and its subsequent use. The existing analogues analysis is carried out, due to which a list of advantages and disadvantages is formed and taken into account in developing the virtual laboratory. A web application is created that clearly illustrates the work of graph algorithms, such as Depth-First Search, Dijkstra’s Shortest Path, Floyd- Warshall, Kruskal Minimum Cost Spanning Tree Algorithm. A simple and user- friendly interface is developed and it is supported by

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!