Results 101 to 110 of about 2,238,100 (388)
Spanning trees for many different numbers of leaves [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous.
Kenta Noguchi, Carol T. Zamfirescu
doaj +1 more source
Some NP-complete edge packing and partitioning problems in planar graphs [PDF]
, 2014 Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not share edges ...
Yang, Jed
core
Using petal-decompositions to build a low stretch spanning tree
Symposium on the Theory of Computing, 2012 We prove that any graph G=(V,E) with n points and m edges has a spanning tree T such that ∑(u,v)∈ E(G)dT(u,v) = O(m log n log log n). Moreover such a tree can be found in time O(m log n log log n).
Ittai Abraham, Ofer Neiman
semanticscholar +1 more source
Deformation Behavior of Optical Ceramic Nanomultilayers: The Role of Aperiodicity
Advanced Engineering Materials, EarlyView.Ceramic nanomultilayers demonstrate optical and mechanical behavior tunability through aperiodicity. Within the studied systems, optically optimized coatings exhibit an average ultraviolet, visible, and near‐infrared spectral transmittance above 90%.
Danielle E. White +5 more
wiley +1 more source
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.
Consoli, S +3 more
core +2 more sources
, 2012 In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals.
Grandoni, Fabrizio
core +1 more source
Leafy spanning trees in hypercubes
Applied Mathematics Letters, 2001 A lower bound is found for the number of leaves of a spanning tree in a \(d\)-dimensional hypercube. This improves on the bound implied by a more general result of \textit{D. J. Kleitman} and \textit{D. B. West} [SIAM J. Discrete Math. 4, No. 1, 99-106 (1991; Zbl 0734.05041)].
Duckworth, W +3 more
openaire +3 more sources
Advanced Functional Materials, EarlyView.This study demonstrates an alternative method of creating charge‐stable negatively charged nitrogen vacancy (NV−) centers close to the diamond surface without high‐temperature annealing. By illuminating nitrogen‐implanted regions with a continuous‐wave 405 nm laser, NV− centers are induced, exhibiting electron spin coherence properties suitable for ...
Jens Fuhrmann +4 more
wiley +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
Micropatterned Biphasic Printed Electrodes for High‐Fidelity on‐Skin Bioelectronics
Advanced Functional Materials, EarlyView.Micropatterned biphasic printed electrodes achieve unprecedented skin conformity and low impedance by combining liquid‐metal droplets with microstructured 3D lattices. This scalable approach enables high‐fidelity detection of ECG, EMG, and EEG signals, including alpha rhythms from the forehead, with long‐term comfort and stability.
Manuel Reis Carneiro +4 more
wiley +1 more source