Results 31 to 40 of about 128,042 (286)
Journal of Numerical Analysis and Approximation Theory, 2005 We present an overview of the approximation theory in combinatorial optimization. As an application we consider the Generalized Minimum Spanning Tree (GMST) problem which is defined on an undirected complete graph with the nodes partitioned into ...
Petrică C. Pop, G. Still, W. Kern
doaj +2 more sources
Solving the Minimum Spanning Tree Problem Under Interval-Valued Fermatean Neutrosophic Domain [PDF]
Neutrosophic Sets and SystemsIn classical graph theory, the minimal spanning tree (MST) is a subgraph that lacks cycles and efficiently connects every vertex by utilizing edges with the minimum weights.
Souhail Dhouib +3 more
doaj +1 more source
Selection of Random Minimum Spanning Tree Based on Intuitionistic Fuzzy Sets [PDF]
Jisuanji gongcheng, 2016 To solve the difficulty of selecting nodes for network topology in complex environment,a selection method of random minimum spanning tree based on intuitionistic fuzzy sets is proposed.Through analyzing the uncertainty,like randomness and fuzziness ...
WANG Xiaoxia,YANG Fengbao,YUAN Hua
doaj +1 more source
On Generalizations of Network Design Problems with Degree Bounds [PDF]
, 2009 Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling ...
A. Frank +15 more
core +3 more sources
Near-linear Time Algorithm for Approximate Minimum Degree Spanning Trees
, 2020 Given a graph $G = (V, E)$, we wish to compute a spanning tree whose maximum vertex degree, i.e. tree degree, is as small as possible. Computing the exact optimal solution is known to be NP-hard, since it generalizes the Hamiltonian path problem. For the
G Yao +6 more
core +1 more source
Advanced Engineering Materials, EarlyView.This article presents the design, modeling, and characterization of air‐pressure–actuated programmable vibroacoustic metamaterials (PVAMM). The study focuses on leveraging air pressure to dynamically tune resonance frequencies for effective noise attenuation.
William Kaal +2 more
wiley +1 more source
Generalized minimum spanning tree games
EURO Journal on Computational Optimization, 2016 The minimum-cost spanning tree game is a special class of cooperative games defined on a graph with a set of vertices and a set of edges, where each player owns a vertex. Solutions of the game represent ways to distribute the total cost of a minimum-cost
PhuocHoang Le +2 more
doaj +1 more source
MEMBANGUN POHON MERENTANG MINIMUM DENGAN MENGGUNAKAN ALGORITMA PRIM [PDF]
, 2009 Graph is the method of discrete problem solution searching that was in the real world. Graph has much of concepts. The ones is Tree concept. Tree concept is being the significant and the popular concept because support to applies graph for a lot of ...
SUSIANI, ERNA
core
Advanced Functional Materials, EarlyView.Shellac, a centuries‐old natural resin, is reimagined as a green material for flexible electronics. When combined with silver nanowires, shellac films deliver transparency, conductivity, and stability against humidity. These results position shellac as a sustainable alternative to synthetic polymers for transparent conductors in next‐generation ...
Rahaf Nafez Hussein +4 more
wiley +1 more source
Spanning Trees Minimizing Branching Costs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$.
Luisa Gargano, Adele A. Rescigno
doaj +1 more source