Zobrazeno 1 - 10
of 1 667
pro vyhledávání: '"kruskal's algorithm"'
Publikováno v:
University of Sindh Journal of Information and Communication Technology, Vol 6, Iss 4, Pp 1-7 (2023)
This paper solves the problem of optimal modelling in a transmission network based on the minimum weight spanning tree method while comparing these results with those obtained by the shortest path method. More precisely, we have modelled the electric
Externí odkaz:
https://doaj.org/article/59953fcba7f74db6892ca6b99ab4f219
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 409-418 (2021)
We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph. This leads to a characterization of chordal graphs via deletion
Externí odkaz:
https://doaj.org/article/6af71fabb87f4fecb238a0fcd033b9b8
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Anwar Nsaif Jasim, Kadhim Aljanabi
Publikováno v:
Journal of Kufa for Mathematics and Computer, Vol 7, Iss 2 (2021)
— 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 meth
Externí odkaz:
https://doaj.org/article/485b84d491cf4778af492123335de9ba
Autor:
Murat Çalışkan, Berk Anbaroğlu
Publikováno v:
SoftwareX, Vol 12, Iss , Pp 100553- (2020)
Graphs describing the relation between nodes and edges are common in geographic information science. One of the algorithms that operate on graphs is ‘Minimum Spanning Tree (MST)’, which is a tree that connects all the nodes of a graph with minimu
Externí odkaz:
https://doaj.org/article/09451036142847408dd42d2922d37937
Autor:
Paryati, Salahddine Krit
Publikováno v:
E3S Web of Conferences, Vol 297, p 01062 (2021)
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
Externí odkaz:
https://doaj.org/article/08d38f5d9c6d4ad3882a0994a5a2dd33
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
K.P.O.Niluminda, E.M.U.S.B.Ekanayake
A Transportation Problem (TP) involves figuring out how to effectively use the resources of “m” supply stations to meet the needs of “n” demand places while also maximizing efficiency. In general, a variable cost of delivering the goods from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19ca70b996af80e5e5006189de0101eb
Autor:
Ruggero G. Pensa, Elena Battaglia
Publikováno v:
Machine Learning. 112:385-427
The majority of the data produced by human activities and modern cyber-physical systems involve complex relations among their features. Such relations can be often represented by means of tensors, which can be viewed as generalization of matrices and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb0d181866f3d2e68a09c986db698726
https://doi.org/10.1007/s10994-021-06002-w
https://doi.org/10.1007/s10994-021-06002-w