Results 71 to 80 of about 133,936 (292)

The Modified CW1 Algorithm for the Degree Restricted Minimum Spanning Tree Problem [PDF]

, 2013
Given edge weighted graph G (all weights are non-negative), The Degree Constrained Minimum Spanning Tree Problem is concerned with finding the minimum weight spanning tree T satisfying specified degree restrictions on the vertices.
Caccetta, L. (Louis), Wamiliana, W. (Wamiliana)   +1 more
core  

2D Magnetic and Topological Quantum Materials and Devices for Ultralow Power Spintronics

Advanced Functional Materials, EarlyView.
2D magnets and topological quantum materials enable ultralow‐power spintronics by combining robust magnetic order with symmetry‐protected, Berry‐curvature‐driven transport. Fundamentals of 2D anisotropy and spin‐orbit‐coupling induced band inversion are linked to scalable growth and vdW stacking.
Brahmdutta Dixit, Yifei Yang, Shawn Li, Yu‐Chia Chen, Qi Jia, Jian‐Ping Wang   +5 more
wiley   +1 more source

Objective Programming Partitions and Rule-Based Spanning Tree for UAV Swarm Regional Coverage Path Planning

Drones
To address the problem of regional coverage path planning for unmanned aerial vehicle swarms (UAVs), this study proposes an algorithm based on objective programming partitions (OPP) and rule-based spanning tree coverage (RSTC). Aiming at the shortcomings
Bangrong Ruan, Tian Jing, Meigen Huang, Xi Ning, Jiarui Wang, Boquan Zhang, Fengyao Zhi   +6 more
doaj   +1 more source

Obstacle-Avoiding Connectivity Restoration Based on Quadrilateral Steiner Tree in Disjoint Wireless Sensor Networks

IEEE Access, 2019
In the harsh environment, wireless sensor networks can suffer from a significant damage that causes many nodes/links to fail simultaneously and the network to get splitted into multiple disjoint partitions.
Bo Chen, Hongsheng Chen, Chunhui Wu
doaj   +1 more source

Universal Loop-Free Super-Stabilization [PDF]

, 2010
We propose an univesal scheme to design loop-free and super-stabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isomorphic to a shortest path tree). Our scheme combines a novel super-stabilizing loop-
Blin, Lélia, Potop-Butucaru, Maria, Rovedakis, Stephane, Tixeuil, Sébastien   +3 more
core   +3 more sources

Nanothermometry in Living Cells: Physical Limits, Conceptual and Material Challenges

Advanced Functional Materials, EarlyView.
Heat and temperature are fundamental to life. When nanothermometers began probing regions as small as a living cell, they triggered controversial claims of large intracellular temperature gradients. We review physical constraints energy‐conservation, entropy production, thermodynamic fluctuations, and molecular dynamics.
Taras Plakhotnik
wiley   +1 more source

A Simulated Annealing algorithm using the Node-depth Phylogenetic structure for the Degree-Constrained Minimum Spanning Tree problem

CLEI Electronic Journal
The degree-constrained minimum spanning tree problem (DCMST) is an NP-hard optimization problem defined on connected weighted graphs. It consists of computing a minimum-cost spanning tree of the graph whose nodes have degrees smaller or equal to a ...
José Flavio Lopes, Iago Augusto Carvalho   +1 more
doaj   +1 more source

On the Size and the Approximability of Minimum Temporally Connected Subgraphs [PDF]

, 2016
We consider temporal graphs with discrete time labels and investigate the size and the approximability of minimum temporally connected spanning subgraphs.
Axiotis, Kyriakos, Fotakis, Dimitris
core   +2 more sources

Selenium‐Incorporated Polymerized Nonfullerene Acceptors/SWCNT Composites with Polymer‐Assisted n‐Doping for High‐Performance Organic Thermoelectrics

Advanced Functional Materials, EarlyView.
Selenium‐incorporated polymerized nonfullerene acceptor PCB2Se forms a strong supramolecular complex with SWCNTs, enabling a record‐high zT of 0.29. Sequential N‐DMBI doping, mediated through a polymer‐assisted electron‐transfer pathway, successfully converts the PCB2Se/SWCNT composite into an efficient n‐type material with an impressive power factor ...
Chi‐Chun Tseng, Che‐An Chou, Chi Chang, Li‐Lun Yeh, Chien‐Yi Ku, Jhih‐Min Lin, Shih‐Huang Tung, Cheng‐Liang Liu, Yen‐Ju Cheng   +8 more
wiley   +1 more source

Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter [PDF]

, 2018
We study the minimum diameter spanning tree problem under the reload cost model (DIAMETER-TREE for short) introduced by Wirth and Steffan (2001). In this problem, given an undirected edge-colored graph G, reload costs on a path arise at a node where the
, Baste, Julien, Paul, Christophe, Sau, Ignasi, Shalom, Mordechai, Thilikos, Dimitrios M.   +5 more
core   +1 more source