Results 11 to 20 of about 1,374,964 (300)
Constructive Heuristics for the Minimum Labelling Spanning Tree Problem: a preliminary comparison [PDF]
, 2006 This report studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible.
Moreno, J A +3 more
core +6 more sources
Patria Artha Technological Journal, 2022 Sebagai salah satu jenis UKM dibidang kuliner, Thai Tea Azka dihadapkan dengan berbagai persoalan optimalisasi manajemen sumber daya. Dalam persoalan penugasan karyawan Thai Tea Azka mengalami kendala dalam penempatan tiap karyawan karena belum memiliki ...
Fauzan As Habi +2 more
doaj +1 more source
Clustered Spanning Tree - Conditions for Feasibility [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Let H =< V, S > be a hypergraph, where V is a set of vertices and S is a set of not necessarily disjoint clusters Si ⊆ V. The Clustered Spanning Tree problem is to find a spanning tree of G which satisfies that each cluster induces a subtree, when it ...
Nili Guttmann-Beck +2 more
doaj +1 more source
Planar bichromatic bottleneck spanning trees
Journal of Computational Geometry, 2021 Given a set $P$ of red and blue points in the plane, a planar bichromatic spanning tree of $P$ is a geometric spanning tree of $P$, such that each edge connects a red and a blue point, and no two edges intersect.
Karim Abu-Affash +3 more
doaj +1 more source
End‐faithful spanning trees in graphs without normal spanning trees [PDF]
Journal of Graph Theory, 2022 AbstractSchmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to characterise other important classes of graphs. In this paper, we address Halin's question: we characterise an
Carl Bürger, Jan Kurkofka
openaire +4 more sources
Efficient phase unwrapping [PDF]
, 2005 In the field of optical interferometry, two-dimensional projections of light interference patterns are often analysed in order to obtain measurements of interest.
AI-Sawaf, Firas
core +7 more sources
Degree-Constrained k-Minimum Spanning Tree Problem
Complexity, 2020 Let GV,E be a simple undirected complete graph with vertex and edge sets V and E, respectively. In this paper, we consider the degree-constrained k-minimum spanning tree (DCkMST) problem which consists of finding a minimum cost subtree of G formed with ...
Pablo Adasme, Ali Dehghan Firoozabadi
doaj +1 more source
The Spanning Tree of a Divisible Multiple Graph
Моделирование и анализ информационных систем, 2018 In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges.
Alexander V. Smirnov
doaj +1 more source
Kubik, 2021 Penelitian ini membahas tentang penyelesaian masalah transportasi dengan pendekatan Minimum Spanning Tree (MST) menggunakan algoritma Kruskal dan algoritma Prim untuk mencari solusi optimal.
Yusufiani Nurlinawati Dili +2 more
doaj +1 more source
On Polynomials of Spanning Trees [PDF]
Annals of Combinatorics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chung, Fan, Yang, Chao
openaire +1 more source