Results 81 to 90 of about 227,714 (275)
The generalized minimum spanning tree problem [PDF]
, 2000 We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard.
Kern, W., Pop, P.C., Still, G.J.
core +2 more sources
Spanning Trees in Random Satisfiability Problems
, 2006 Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the ...
A Ramezanpour +6 more
core +1 more source
Advanced Functional Materials, EarlyView.A novel stratum corneum‐inspired zwitterionic hydrogel is developed for intelligent, flexible sensors, featuring intrinsic water retention and anti‐freezing properties. The quasi‐gel, composed of hygroscopic polymers and bound water, maintains its softness across a wide range of humidity.
Meng Wu +8 more
wiley +1 more source
Spanning trees with small diameters
AKCE International Journal of Graphs and Combinatorics, 2020 A spanning tree with small diameter of a graph has many applications. In this paper we first make the following conjecture and show that the condition is best possible if it is true. If a connected graph satisfies , then has a spanning tree with diameter
Mikio Kano, Hajime Matsumura
doaj +1 more source
Comparative Study of Various Wireless Sensor Network (WSN) Topology Construction Protocols [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2014 As the cost for wireless sensors and wireless sensor networks (WSNs) have decreased, they have become more ubiquitous; they are increasingly being used in many applications such as security, structural monitoring and environmental monitoring.
Lifford McLauchlan +3 more
doaj +1 more source
, 2018 Given an undirected connected graph $G(V, E)$, constructing a spanning tree is a well studied problem with polynomial time algorithms. If we restrict the spanning tree to be "regular" as defined below, it turns out that this becomes a very hard problem.
openaire +2 more sources
Advanced Functional Materials, EarlyView.Symmetry‐broken plasmonic nanoantenna arrays achieve broadband multiresonant enhancement of second harmonic generation (SHG), third harmonic generation (THG), and upconversion photoluminescence (UCPL), under femtosecond laser excitation across the near‐infrared range (1000–1600 nm).
Elieser Mejia +9 more
wiley +1 more source
, 2019 Interna računalna mreža je velika računalna mreža koja se sastoji od više međusobno povezanih LAN mreža i obično se nalaze na istom geografskom području. Prema hijerarhijskom mrežnom modelu dijeli se u tri jasno odvojena sloja, pristupa, distribucije i jezgre.
Nikola Jelečki, Vedran Turkalj
openaire +2 more sources
Active Learning‐Driven Discovery of Sub‐2 Nm High‐Entropy Nanocatalysts for Alkaline Water Splitting
Advanced Functional Materials, EarlyView.High‐entropy nanoparticles (HENPs) hold great promise for electrocatalysis, yet optimizing their compositions remains challenging. This study employs active learning and Bayesian Optimization to accelerate the discovery of octonary HENPs for hydrogen and oxygen evolution reactions.
Sakthivel Perumal +5 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