Results 81 to 90 of about 4,433,930 (229)
Independent Spanning Trees with Small Stretch Factors
, 1996 A pair of spanning trees rooted at a vertex r are independent if for every vertex v the pair of unique tree paths from v to the root r are disjoint. This paper presents the first analysis of the path lengths involved in independent spanning trees in 2 ...
Ram Swaminathan +2 more
core
Algorithm for Generating All Spanning Trees of Complete Undirected Graphs [PDF]
, 2005 Let G be a complete undirected graph with n vertices, e edges and m spanning trees. In this paper we give an algorithm for finding explicitly all spanning trees of G. Our technique is based on the representation of spanning trees by Prufer numbers.
Sakawa, Masatoshi +3 more
core
Advanced Science, EarlyView.Recent advances in metasurface‐enabled low‐observable technologies are reviewed from the perspective of cross‐scale material–structure synergy. Electromagnetic, thermal, optical, and acoustic stealth are highlighted together with dynamic tuning, programmable coding, data‐driven inverse design, artificial intelligence, multispectral compatibility, and ...
Shuhao Wang +5 more
wiley +1 more source
An Ever Closer Union? Examining The Evolution Of The Integration Of European Equity Markets Via Minimum Spanning Trees [PDF]
The concept of a minimum spanning tree (MST) is used to study the process of comovements for 21 European Union stock market indices. We show how the asset tree and its related hierarchical tree evolve over time and describe the dynamics.
Marian Boscia +2 more
core
Advanced Science, EarlyView.MAPA transforms complex multi‐omics data into biologically coherent functional modules by integrating pathway information with molecular interaction networks. Retrieval‐augmented large language models then generate structured, literature‐informed interpretations.
Yifei Ge +13 more
wiley +1 more source
A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem [PDF]
In this paper we present a probabilistic tabu search algorithm for the generalized minimum spanning tree problem. The basic idea behind the algorithm is to use preprocessing operations to arrive at a probability value for each vertex which roughly ...
Ghosh, Diptesh
core
Advanced Science, EarlyView.By integrating 516 whole‐genome resequencing datasets and 236 transcriptomes of allotetraploid common carp, this study establishes the first population‐scale atlas of transposable element (TE) variation in teleost species. TE bursts, relaxed purifying selection, and lineage‐specific loss of ancient insertions shape genome evolution and phenotypic ...
Shuimu Hu +11 more
wiley +1 more source
Advanced Science, EarlyView.Adult human organotypic cortical slices undergo marked neuronal loss, laminar disruption, and glial activation, yet their network activity progressively stabilizes after a variable period. Electrophysiology, longitudinal calcium imaging, and quantitative histology show that structurally remodeled human circuits show adaptive capacity resulting in ...
Estilla Zsófia Tóth +20 more
wiley +1 more source
Advanced Electronic Materials, EarlyView.In this work, low‐resolution infrared imaging is combined with a 28 nm FeFET IMC architecture to enable compact, energy‐efficient edge inference. MLC FeFET devices are experimentally characterized, and controlled multi‐level current accumulation is validated at crossbar array level.
Alptekin Vardar +9 more
wiley +1 more source
Advanced Electronic Materials, EarlyView.A compact QASRR‐based THz metamaterial absorber enables polarization‐insensitive dual‐band absorption and skin‐cancer‐related refractive‐index sensing through measurable resonance shifts. Field, surface‐current, and circuit analyses clarify the dual‐resonance mechanism, while StackNet‐assisted prediction accurately estimates the simulated absorption ...
Md. Murad Kabir Nipun +5 more
wiley +1 more source