Log in

Relevant bibliographies by topics / Kruskal’s algorithm / Journal articles

To see the other types of publications on this topic, follow the link: Kruskal’s algorithm.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Luo, Mao, Huigang Qin, Xinyun Wu, Caiquan Xiong, Dahai Xia, and Yuanzhi Ke. "Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs." Mathematics 12, no. 7 (2024): 1021. http://dx.doi.org/10.3390/math12071021.

Full text

Abstract:

This paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes. By identifying the portion of the original tree that can be preserved in the updated tree, our algorithm avoids recalculating the minimum spanning tree from scratch. We provide proof of correctness for the proposed algorithm and analyze its time complexity. In general scenarios, the time complexity of our algorithm is comparable to that of Kruskal’s algorithm. Howeve

APA, Harvard, Vancouver, ISO, and other styles

12

Potebnia, Artem, and Sergiy Pogorilyi. "Formation and investigation of Kruskal’s algorithm parallel scheme for shared memory systems." Informatics, Cybernetics and Computer Science. Scientific Papers of Donetsk National Technical University 16(204) (March 23, 2012): 82–89. https://doi.org/10.5281/zenodo.16440.

Full text

Abstract:

Formalization of Kruskal’s algorithm for constructing a minimal spanning tree of an undirected graph using mathematical means of V.M. Glushkov’s algorithmic algebras modified systems is done. The conception of its paralleling for shared memory computer systems architectures is proposed. A set of algorithm investigations is conducted and its temporal characteristics are formed. Recommendations of algorithm usage for applied tasks solving are provided.

APA, Harvard, Vancouver, ISO, and other styles

13

Swathika, O. V. Gnana, Nilabhra Banerjee, and S. K. Pranesh. "Hybrid Kruskal’s-Dijkstra’s Algorithm for Shortest Path Identification in Reconfigurable Microgrid." Advanced Science Letters 23, no. 5 (2017): 4215–18. http://dx.doi.org/10.1166/asl.2017.8310.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

., Pavana D. "POWER SYSTEM RESTORATION IN DISTRIBUTION NETWORK THROUGH RECONFIGURATION USING MST-KRUSKAL’S ALGORITHM." International Journal of Research in Engineering and Technology 04, no. 07 (2015): 295–99. http://dx.doi.org/10.15623/ijret.2015.0407049.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Krishnaa, Auparajita. "Some Algorithms of Graph Theory in Cryptology." Indian Journal of Advanced Mathematics 4, no. 1 (2024): 9–15. http://dx.doi.org/10.54105/ijam.a1167.04010424.

Full text

Abstract:

The inventive use of concepts from Graph Theory plays a significant role in hiding the original Plain-text for resulting in a significantly safe data transfer. In this work, the tree traversal algorithms like Inorder, Preorder, Postorder, Kruskal’s algorithm for making minimal spanning tree and the modified graph labelling scheme of graceful labelling allowing repetition of exactly one vertex label for certain graphs, have been employed to create highly hidden Cipher-texts. Encryption and decryption algorithms for all these methods are being presented in this work.

APA, Harvard, Vancouver, ISO, and other styles

16

Ramirez, Juan M., and Diana P. Montoya. "A Piecewise Solution to the Reconfiguration Problem by a Minimal Spanning Tree Algorithm." International Journal of Emerging Electric Power Systems 15, no. 5 (2014): 419–27. http://dx.doi.org/10.1515/ijeeps-2013-0094.

Full text

Abstract:

Abstract This paper proposes a minimal spanning tree (MST) algorithm to solve the networks’ reconfiguration problem in radial distribution systems (RDS). The paper focuses on power losses’ reduction by selecting the best radial configuration. The reconfiguration problem is a non-differentiable and highly combinatorial optimization problem. The proposed methodology is a deterministic Kruskal’s algorithm based on graph theory, which is appropriate for this application generating only a feasible radial topology. The proposed MST algorithm has been tested on an actual RDS, which has been split int

APA, Harvard, Vancouver, ISO, and other styles

17

Çakır, Esra, and Ziya Ulukan. "A Hybrid Kruskal’s Algorithm Based on Intuitionistic Fuzzy with Hamacher Aggregation Operator for Road Planning." International Journal of Fuzzy Systems 23, no. 4 (2021): 1003–16. http://dx.doi.org/10.1007/s40815-020-01007-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Munier, Badri, Muhammad Aleem, Muhammad Arshad Islam, Muhammad Azhar Iqbal, and Waqar Mehmood. "A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms." Sukkur IBA Journal of Computing and Mathematical Sciences 1, no. 1 (2017): 58. http://dx.doi.org/10.30537/sjcms.v1i1.8.

Full text

Abstract:

In last decade, application developers attained improved performances by merely employing the machines based on higher-clocked processors. However, in 2003 multi-core processors emerged and eradicated the old processor manufacturing technology based on increasing processor’s clock frequencies. After emergence of new parallel processor architectures, serial applications must be re-engineered into parallel versions to exploit the computing power of the existing hardware. In this paper, we present an efficient parallel implementation of minimum spanning tree algorithm to take advantage of the com

APA, Harvard, Vancouver, ISO, and other styles

19

Melnikov, B. F., and Y. Y. Terentyeva. "Building communication networks: on the application of the Kruskal’s algorithm in the problems of large dimensions." IOP Conference Series: Materials Science and Engineering 1047, no. 1 (2021): 012089. http://dx.doi.org/10.1088/1757-899x/1047/1/012089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Schäfer, Jörg. "A Note on Ultrametric Spaces, Minimum Spanning Trees and the Topological Distance Algorithm." Information 11, no. 9 (2020): 418. http://dx.doi.org/10.3390/info11090418.

Full text

Abstract:

We relate the definition of an ultrametric space to the topological distance algorithm—an algorithm defined in the context of peer-to-peer network applications. Although (greedy) algorithms for constructing minimum spanning trees such as Prim’s or Kruskal’s algorithm have been known for a long time, they require the complete graph to be specified and the weights of all edges to be known upfront in order to construct a minimum spanning tree. However, if the weights of the underlying graph stem from an ultrametric, the minimum spanning tree can be constructed incrementally and it is not necessar

APA, Harvard, Vancouver, ISO, and other styles

21

Kheddam, Radja, Youcef Boudissa, and Aichouche Belhadj-Aissa. "Kruskal’s algorithm combined to multinet Bayesian network classifier for mapping Algiers urban areas using ALSAT2-A imagery." Journal of Applied Remote Sensing 12, no. 03 (2018): 1. http://dx.doi.org/10.1117/1.jrs.12.036007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

M, Nandhini, and Ramya M. "Application of Graph Theory to Find Minimal Paths Between Two Places for the Transportation Problem." International Journal for Research in Applied Science and Engineering Technology 10, no. 11 (2022): 1199–205. http://dx.doi.org/10.22214/ijraset.2022.47567.

Full text

Abstract:

Abstract: Graph theory is used for finding communities in networks. Graphs are used as device for modeling and description of real world network systems such are: transport, water, electricity, internet, work operations schemes in the process of production, construction, etc. Although the content of these schemes differ among themselves, but they have also common features and reflect certain items that are in the relation between each other. In this paper, we study on how graph theory can generate transportation problem using shortest path, we designed the solution for practical problem to fin

APA, Harvard, Vancouver, ISO, and other styles

23

Shaik, Faizaan, Srikanth Bezawada, and Neena Goveas. "CySpanningTree: Minimal Spanning Tree computation in Cytoscape." F1000Research 4 (August 5, 2015): 476. http://dx.doi.org/10.12688/f1000research.6797.1.

Full text

Abstract:

Simulating graph models for real world networks is made easy using software tools like Cytoscape. In this paper, we present the open-source CySpanningTree app for Cytoscape that creates a minimal/maximal spanning tree network for a given Cytoscape network. CySpanningTree provides two historical ways for calculating a spanning tree: Prim’s and Kruskal’s algorithms. Minimal spanning tree discovery in a given graph is a fundamental problem with diverse applications like spanning tree network optimization protocol, cost effective design of various kinds of networks, approximation algorithm for som

APA, Harvard, Vancouver, ISO, and other styles

24

Wang, Lei, Yuanyuan Fu, and Yingchao Zhang. "A Career Recommendation Method for College Students Based on Occupational Values." International Journal of Emerging Technologies in Learning (iJET) 18, no. 01 (2023): 201–15. http://dx.doi.org/10.3991/ijet.v18i01.37127.

Full text

Abstract:

The numerous recruitment information and the information asymmetry between college majors and work posts make it difficult for college students to seize the job opportunities that conform to their occupational values, and the employment success rate is always at a low level. The effect of current college student career recommendation systems is usually unsatisfactory, and the existing systems haven’t fully considered the role of college students’ occupational values in instructing their employment. To fill in this research blank, this paper studied a career recommendation method for college st

APA, Harvard, Vancouver, ISO, and other styles

25

Nsaif Jasim, Anwar, and Kadhim Aljanabi. "A New Approach for Solving Multi Products Transportation Problem." Journal of Kufa for Mathematics and Computer 7, no. 2 (2021): 1–6. http://dx.doi.org/10.31642/jokmc/2018/070201.

Full text

Abstract:

— The problem of transportation is studied in many areas, most importantly in the field of logistics and operations management. The distribution problem of goods and commodities from sources to destinations is an important problem where many methods have been used to obtain its optimum solution, which represents the minimum cost of distribution the goods from sources to destinations. Generally, the transportation classical cost of one unit of a good is depending on the source and the destination. In this paper, we suggest an approach to obtain a solution to the tr

APA, Harvard, Vancouver, ISO, and other styles

26

МАРЧУК, Г. В., М. С. ГРАФ, В. Л. ЛЕВКІВСЬКИЙ та Ю. В. ВЕНГЛОВСЬКА. "АНАЛІЗ ТА ПОРІВНЯННЯ ІСНУЮЧИХ МЕТОДІВ ГЕНЕРАЦІЇ ЛАБІРИНТІВ В КОМП’ЮТЕРНИХ ІГРАХ". Вісник Херсонського національного технічного університету, № 3(90) (26 листопада 2024): 228–37. http://dx.doi.org/10.35546/kntu2078-4481.2024.3.29.

Full text

Abstract:

В епоху інформаційного суспільства, де візуалізація ігрових та симуляційних просторів набуває все більшого значення, розробка алгоритмів для генерування лабіринтів стає все більш актуальною. Інтерактивні ігри, віртуальна реальність, навчальні платформи та інші сфери потребують генерації лабіринтів різної складності та конфігурації, щоб забезпечити різноманіття та захоплюючий досвід для гравців та користувачів. Традиційні методи генерації лабіринтів, такі як алгоритм Вілсона або алгоритм Прима, можуть бути обмежені у своїй гнучкості та здатності створювати лабіринти з заданими характеристиками.

APA, Harvard, Vancouver, ISO, and other styles

27

Lai, Jingang, Hong Zhou, Wenshan Hu, Dongguo Zhou, and Liang Zhong. "Smart Demand Response Based on Smart Homes." Mathematical Problems in Engineering 2015 (2015): 1–8. http://dx.doi.org/10.1155/2015/912535.

Full text

Abstract:

Smart homes (SHs) are crucial parts for demand response management (DRM) of smart grid (SG). The aim of SHs based demand response (DR) is to provide a flexible two-way energy feedback whilst (or shortly after) the consumption occurs. It can potentially persuade end-users to achieve energy saving and cooperate with the electricity producer or supplier to maintain balance between the electricity supply and demand through the method of peak shaving and valley filling. However, existing solutions are challenged by the lack of consideration between the wide application of fiber power cable to the h

APA, Harvard, Vancouver, ISO, and other styles

28

Bianchi, Maria Paola, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, and Beatrice Palano. "Online Minimum Spanning Tree with Advice." International Journal of Foundations of Computer Science 29, no. 04 (2018): 505–27. http://dx.doi.org/10.1142/s0129054118410034.

Full text

Abstract:

In the online minimum spanning tree problem, a graph is revealed vertex by vertex; together with every vertex, all edges to vertices that are already known are given, and an online algorithm must irrevocably choose a subset of them as a part of its solution. The advice complexity of an online problem is a means to quantify the information that needs to be extracted from the input to achieve good results. For a graph of size [Formula: see text], we show an asymptotically tight bound of [Formula: see text] on the number of advice bits to produce an optimal solution for any given graph. For parti

APA, Harvard, Vancouver, ISO, and other styles

29

Boyko, N. I., and T. O. Salanchii. "DEVELOPMENT OF INNOVATIVE APPROACHES FOR NETWORK OPTIMIZATION USING GEOSPATIAL MULTI-COMPONENT SYSTEMS." Radio Electronics, Computer Science, Control, no. 2 (June 29, 2025): 182–95. https://doi.org/10.15588/1607-3274-2025-2-16.

Full text

Abstract:

Context. Developing a geospatial multi-agent system for optimizing transportation networks is crucial for enhancing efficiency and reducing travel time. This involves employing optimization algorithms and simulating agent behavior within the network.Objective. The aim of this study is to develop a geospatial multi-agent system for optimizing transportation networks, focusing on improving network efficiency and minimizing travel time through the application of advanced optimization algorithms and agentbased modeling.Method. The proposed method for optimizing transportation networks combines fou

APA, Harvard, Vancouver, ISO, and other styles

30

Maskar, Sugama. "Maximum Spanning Tree Graph Model: National Examination Data Analysis of Junior High School in Lampung Province." Proceeding International Conference on Science and Engineering 3 (April 30, 2020): 375–78. http://dx.doi.org/10.14421/icse.v3.531.

Full text

Abstract:

The purpose of this study is to determine the tendencies of learning in Lampung Province especially at junior high school level. Subjects of this study are all result of national examination data for junior high school in 2017 and 2018 in Lampung Province. The method of this study using model analysis of maximum spanning tree (MST) graph assisted by descriptive and inferential statistics technique. The data obtained are analysed using descriptive statistical analysis to find out the basic information of the data and inferential statistical analysis to get the value of coefficient correlation.

APA, Harvard, Vancouver, ISO, and other styles

31

Mohapatra, Chittaranjan, and Nibedita Adhikari. "A NOBLE RECTILINEAR STEINER TREE WITH OBSTACLES USING PARALLEL DQN: NRST." ICTACT Journal on Microelectronics 11, no. 1 (2025): 1989–96. https://doi.org/10.21917/ijme.2025.0339.

Full text

Abstract:

Given a set of pins and obstacles in a Very-Large-Scale Integration (VLSI) chip layout, the goal is to develop an optimal routing path with minimal wire length. This work construct Obstacle Avoidance Rectilinear Steiner Minimal Tree (OARSMT) using a deep Q-learning approach, a type of reinforcement learning. It employs union-find data structure, parallel Deep Q-Network and Adam optimizer to train an agent to determine the optimal connection between pins. The DQN approximates Q-values, which reflect the likelihood of selecting an edge. Connections with higher Q-values are those that are obstacl

APA, Harvard, Vancouver, ISO, and other styles

32

Karlov, A. V., and O. V. Evseev. "Approaches to Methodological Rationale of Development of Single Backbone Transport Network and Prioritisation of Transport Infrastructure Development Projects." World of Transport and Transportation 21, no. 6 (2024): 14–21. http://dx.doi.org/10.30932/1992-3252-2023-21-6-2.

Full text

Abstract:

The article discusses approaches to rationale of the development of the Single Backbone Transport Network (SBTN), political, scientific and mathematical prerequisites for identifying key infrastructure elements. The Transport Strategy of the Russian Federation for the period until 2030 with a forecast until 2035 provides basic criteria for each of the backbone networks of modes of transport, while it is highlighted that the development of the SBTN is carried out using transport and economic balance tools. The article explores the possibilities for the practical application of scientific method

APA, Harvard, Vancouver, ISO, and other styles

33

R., R., and A. V. Senthil Kumar. "Improving the Reliability of Wireless Sensor Network Assisted IoT Network with a Cluster-Based Chain-Tree Routing Protocol." Journal of Intelligent Systems and Internet of Things 16, no. 2 (2025): 271–85. https://doi.org/10.54216/jisiot.160220.

Full text

Abstract:

The primary objective of designing routing protocols for Wireless Sensor Networks (WSNs) is to extend the network lifetime by optimizing the use of the limited battery energy of the sensor nodes. To improve conservation of energy and longevity of the network in WSNs, this study proposes a Cluster-based Chain-Tree Routing Protocol (CCTRP). Integrating tree based chain and cluster routing methods in WSNs is the primary objective of this study. This new CCTRP adopts a sector-based vertical network-partitioning scheme that divides network into sectors and it again vertically partitions the nodes t

APA, Harvard, Vancouver, ISO, and other styles

34

Szűgyi-Reiczigel, Zsófia, Márta Ladányi, György Dénes Bisztray, Zsuzsanna Varga, and Péter Bodor-Pesti. "Morphological Traits Evaluated with Random Forest Method Explains Natural Classification of Grapevine (Vitis vinifera L.) Cultivars." Plants 11, no. 24 (2022): 3428. http://dx.doi.org/10.3390/plants11243428.

Full text

Abstract:

There are hundreds of morphologic and morphometric traits available to classify and identify grapevine (Vitis vinifera L.) genotypes, while statistical evaluation of those has certain limitations, especially when we have no information about the traits that are discriminative to a certain sample set. High numbers of investigated characters could cause redundancy, while reducing those numbers may result in data loss. Grapevine is one of the most important horticultural crops, with many cultivars in production. The characterization of the genotypes is of undeniably high importance. In this study

APA, Harvard, Vancouver, ISO, and other styles

35

Pritha, R. Mathu, and A. Amutha. "Fuzzy Tree t -Spanners of Ratio Labelled Butterfly Network." Indian Journal Of Science And Technology 17, SPI1 (2024): 58–63. http://dx.doi.org/10.17485/ijst/v17sp1.164.

Full text

Abstract:

Background/Objectives: The reliability and optimality of a communication system depend on the network that has a minimum distance. The minimum distance is the shortest path between the vertices. Even in error correction codes, the minimum Hamming distance ensures data integrity. Hence to have efficient routing protocols, the network is preferred to be a spanning tree that connects all the nodes of the communication system. As tree t- spanner is the optimization technique in determining minimum spanning tree, finding tree t-spanners of a ratio labelled fuzzy graph for the Butterfly network BF(n

APA, Harvard, Vancouver, ISO, and other styles

36

Moqbel Hassan ALZUBAYDI, Nadia. "DESIGN AND IMPLEMENTATION OF KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM IN C++." MINAR International Journal of Applied Sciences and Technology 2, no. 3 (2020): 35–45. http://dx.doi.org/10.47832/2717-8234.3-2.6.

Full text

Abstract:

The traditional algorithms (Prim) or (Kruskal) are able to obtain A minimum spanning tree (MST) in undirected graph easily. But many algorithms have been proposed for the purpose of obtaining spanning trees in undirected graph, these algorithms are considering the complexities of time and space. Some algorithms are generating spanning trees by using some basic cuts or circuits. In this process, the tree's cost is not considered. In this paper we will describe an algorithm for generating spanning trees in a graph of increasing cost, so we will get many possibilities, such as determining the k-t

APA, Harvard, Vancouver, ISO, and other styles

37

Zhang, Rener. "The comparison of three MST algorithms." Applied and Computational Engineering 17, no. 1 (2023): 191–97. http://dx.doi.org/10.54254/2755-2721/17/20230939.

Full text

Abstract:

The minimum spanning tree, connecting all the nodes of a connected, weighted graph with the minimum possible total edge weight, is a fundamental concept of graph theory. Thus, how to find the minimum spanning tree (MST) with higher efficiency appears to be crucial. Three kinds of algorithms for this problem have already been developed: Kruskal, Prim, Boruvka. In order to make readers have a better understanding of the three algorithms in the process of studying and teaching, this paper uses the method of comparing to indicate the differences and commonalities between these three algorithms, dr

APA, Harvard, Vancouver, ISO, and other styles

38

Min, Jian, Jiaojiao Zhu, and Jian-Bo Yang. "The Risk Monitoring of the Financial Ecological Environment in Chinese Outward Foreign Direct Investment Based on a Complex Network." Sustainability 12, no. 22 (2020): 9456. http://dx.doi.org/10.3390/su12229456.

Full text

Abstract:

Aiming at the risk problem of financial ecological environment in outward foreign direct investment (OFDI), this paper constructs a risk monitoring model of the financial ecological environment based on complex network theory, and analyzes the general laws of financial risk evolution in Chinese OFDI by using data from 2008 to 2017 in 20 countries. First, the key risk factors are found through centrality analysis, then the correlation between risk indicators is obtained by cohesive subgroup analysis. Finally, we calculate network density, clustering coefficient and global efficiency to explore

APA, Harvard, Vancouver, ISO, and other styles

39

Maskar, Sugama, and Nicky Dwi Puspaningtyas. "CLUSTERING SUBJECTS IN LAMPUNG PROVINCIAL NATIONAL EXAMINATION OF JUNIOR HIGH SCHOOL THROUGH MAXIMUM SPANNING TREE." AKSIOMA: Jurnal Program Studi Pendidikan Matematika 10, no. 4 (2021): 2268. http://dx.doi.org/10.24127/ajpm.v10i4.4111.

Full text

Abstract:

AbstrakUjian Nasional yang dilaksanakan setiap tahun di Indonesia telah menghasilkan banyak data, termasuk di Provinsi Lampung. Pada rentang tahun 2015 sampai dengan tahun 2018, telah terkumpul kurang lebih 11 juta data hasil ujian nasional. Data tersebut tentu dapat memberikan banyak informasi untuk perbaikan Pendidikan Indonesia di masa mendatang. Tulisan ini membahas tentang pengelompokan mata pelajaran pada Ujian Nasional SMP di Provinsi Lampung dengan tujuan untuk memetakan hubungan hasil belajar Matematika, IPA, Bahasa Indonesia, dan Bahasa Inggris. Tujuan pengelompokan tersebut sebagai

APA, Harvard, Vancouver, ISO, and other styles

40

Tomeczek, Artur F. "A minimum spanning tree analysis of the Polish stock market." Journal of Economics and Management 44 (2022): 420–45. http://dx.doi.org/10.22367/jem.2022.44.17.

Full text

Abstract:

Aim/purpose – This article aims to explore the network topology of the stock market in Poland during the COVID-19 pandemic. Design/methodology/approach – Kruskal’s algorithm was used to find the minimum spanning trees (MST) of three undirected correlation networks: MST1 (December 2019 – August 2021), MST2 (February 2020 – April 2020), and MST3 (June 2021 – August 2021). There were123 firms included in all three networks representing three key indexes (WIG20, mWIG40, and sWIG80). Findings – The comovements of stock prices varied between various periods of the pandemic. The most central firms in

APA, Harvard, Vancouver, ISO, and other styles

41

Zakiah, Nina. "DIAGRAM ALIR ALGORITMA KRUSKAL DALAM MENENTUKAN MINIMUM SPANNING TREE." JURNAL MATHEMATIC PAEDAGOGIC 5, no. 2 (2021): 151–57. http://dx.doi.org/10.36294/jmp.v5i2.1977.

Full text

Abstract:

AbstractThe flow chart of the minimum spanning tree is represented in a weight matrix as a form of development of the link matrix. Determining the minimum spanning tree in this journal uses the Kruskal algorithm and is implemented in the form of a flow chart. This journal is a study of theories regarding the minimum spanning tree determination problem. With the problem approach, namely: graph theory, trees, determination of Minimum spanning tree, Kruskal's algorithm and flow diagrams. Furthermore, it is implemented in the flowchart of determining the Minimum spanning tree. Keywords: Minimum sp

APA, Harvard, Vancouver, ISO, and other styles

42

Park, Mee-Jeong, Hyun Heo, Tae-Gon Kim, Kyo Suh, and Jeong-Jae Lee. "Watershed Delineation Algorithm Using Kruskal's Algorithm and Triangulated Irregular Network." Journal of The Korean Society of Agricultural Engineers 48, no. 4 (2006): 3–12. http://dx.doi.org/10.5389/ksae.2006.48.4.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Sholikhatin, Siti Alvi, Adi Budi Prasetyo, and Ade Nurhopipah. "IMPLEMENTASI ALGORITMA KRUSKAL DAN ALGORITMA PRIM SUATU GRAPH DENGAN APLIKASI BERBASIS DESKTOP." Jurnal RESISTOR (Rekayasa Sistem Komputer) 3, no. 2 (2020): 89–93. http://dx.doi.org/10.31598/jurnalresistor.v3i2.638.

Full text

Abstract:

A graph has several algorithms in its solution, including the Kruskal algorithm and Prim algorithm, both of which are greedy algorithms for determining the minimum spanning tree. Completion of graphs is useful in various fields of life, so an accurate graph calculation is important. Making an application to solve a graph, especially the Kruskal algorithm and Prim algorithm aims to facilitate the work of the graph so as to produce an accurate final result. The flow of research carried out are: a background review of research, study of literature and relevant literature, application design, buil

APA, Harvard, Vancouver, ISO, and other styles

44

Yu, Xinyi. "Analysis and comparison of two classical greedy algorithms for minimum spanning tree." Theoretical and Natural Science 5, no. 1 (2023): 700–704. http://dx.doi.org/10.54254/2753-8818/5/20230464.

Full text

Abstract:

The total weight of the minimum spanning is the smallest in the connected graph. It can be used to solve many practical problems in urban life. Prims algorithm and Kruskals algorithm are greedy algorithms for solving the minimum spanning tree problem. But they make greedy choices in different ways. The paper focuses on two greedy algorithms for solving the minimum spanning tree problem. The author will evaluate each algorithms complexity and determine their most suitable condition as well. The author compares the running process of the two algorithms and analyzes the relationship between their

APA, Harvard, Vancouver, ISO, and other styles

45

Aditya, Ricky. "ALGORITMA “HANCURKAN SEMUA SIKEL” UNTUK MENENTUKAN POHON PERENTANG MINIMUM DARI SUATU GRAF BERBOBOT." Jurnal Ilmiah Matrik 21, no. 2 (2019): 91–98. http://dx.doi.org/10.33557/jurnalmatrik.v21i2.571.

Full text

Abstract:

The minimum spanning tree is one of the applications of graph theory in various fields. There are several algorithms for determining the minimum spanning tree of a weighted graph, such as Kruskal's algorithm and Prim's algorithm. These two algorithms are not really easy to teach to students in general. Therefore in this paper presented an alternative algorithm called the algorithm "Destroy All Sikel", which is more intuitive and easier to understand. Furthermore, there are also examples of implementation and comparison with two other algorithms.

APA, Harvard, Vancouver, ISO, and other styles

46

Li, Shaozhe. "The Application of Kruskals Algorithm in Bus Route Planning and the Influence of Different Factors on It." Applied and Computational Engineering 2, no. 1 (2023): 596–600. http://dx.doi.org/10.54254/2755-2721/2/20220619.

Full text

Abstract:

Kruskals algorithm is one of the algorithms to build the minimum spanning tree (MST). In this paper, a generalized Kruskals algorithm will be used for solving the bus route problem in real environment. The effect of external factors should be considered if people want to apply the Kruskals algorithm on but route problem in real world. In this article, weather factors and road conditions will be included in the factors that need to be considered. Data on how vehicles are affected by weather and road lighting are derived from papers by other researchers. This paper mentions how to process the co

APA, Harvard, Vancouver, ISO, and other styles

47

Li, YuQi. "Numerical finite-gap integration of the Zabusky–Kruskal problem." Nonlinearity 36, no. 12 (2023): 6260–96. http://dx.doi.org/10.1088/1361-6544/ad03a8.

Full text

Abstract:

Abstract The Zabusky–Kruskal problem (ZKP) is well-known ever since Zabusky and Kruskal performed their famous numerical experiment. It has become a benchmark for testing numerical schemes. However, the solution of the ZKP has no analytical expression and its long-time numerical integration is notoriously difficult. Now, after decades of effort both to develop new algorithms and to improve their performance, the best existing algorithm approaches machine accuracy for moderate evolution time. Here we solve the ZKP with high accuracy using the method of numerical finite-gap integration. The wind

APA, Harvard, Vancouver, ISO, and other styles

48

Li, Haiming, Qiyang Xia, and Yong Wang. "Research and Improvement of Kruskal Algorithm." Journal of Computer and Communications 05, no. 12 (2017): 63–69. http://dx.doi.org/10.4236/jcc.2017.512007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Chen, Jiayu. "The analysis and application of Prim algorithm, Kruskal algorithm, Boruvka algorithm." Applied and Computational Engineering 19, no. 1 (2023): 84–89. http://dx.doi.org/10.54254/2755-2721/19/20231012.

Full text

Abstract:

Minimum spanning tree has many applications in real life. For example, the government needs to build roads between many cities. Therefore, it is necessary to find the plan with the shortest path to save the cost. The problem is essentially generating a minimal spanning tree, and it require a suitable algorithm to find the minimum spanning tree. In this paper, the author analyzes the structure and time complexity of the Prim algorithm, the Kruskal algorithm and the Boruvka algorithm. Through this research, the author finds Prim algorithm is suitable for dense graphs. The Kruskal algorithm can g

APA, Harvard, Vancouver, ISO, and other styles

50

Choi, Myeong-Bok, and Sang-Un Lee. "An Efficient Implementation of Kruskal's and Reverse-Delete Minimum Spanning Tree Algorithm." Journal of the Institute of Webcasting, Internet and Telecommunication 13, no. 2 (2013): 103–14. http://dx.doi.org/10.7236/jiibc.2013.13.2.103.

Full text

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!