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
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
Alternative Multiple Spanning Tree Protocol (AMSTP) for Optical Ethernet Backbones [PDF]
, 2004 The availability and affordable cost of Gigabit and 10 Gigabit Ethernet switches has impacted the deployment of metropolitan area networks (MAN) and campus networks.
Azcorra, Arturo +2 more
core +3 more sources
Meta‐Rod Mechanical Metamaterials With Programmable Reconfiguration
Advanced Functional Materials, EarlyView.Existing mechanical metamaterials achieve programmable large deformations in planar square or cubic configurations, restricted by required complex boundary conditions. This research proposes a 1D metamaterial, Meta‐rod, with linear, bending, twisting, area, and volume deformation modes.
Atharva Pande, Lyes Kadem, Hang Xu
wiley +1 more source
Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs [PDF]
Neutrosophic Sets and SystemsThis research paper presents an innovative approach for determining the minimum spanning tree (MST) in an undirected neutrosophic graph using Prim's Algorithm, which is extensively used in addressing network optimization problems.
Sukanta Ghadei +4 more
doaj +1 more source
Offline algorithms for dynamic minimum spanning tree problems [PDF]
, 1992 We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known.
Eppstein, David
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 +5 more
wiley +1 more source
Heuristics based on greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem [PDF]
, 2007 This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Consoli, S +3 more
core
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
Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs
MathematicsThis paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes.
Mao Luo +5 more
doaj +1 more source