Results 121 to 130 of about 2,238,100 (388)

Wood Reconfiguration Enables Broadband Blackbody in Large‐Area, Modular, Optically Welded Carbon Constructs

open access: yesAdvanced Functional Materials, EarlyView.
Wood‐based broadband blackbody is achieved by reconfiguration of wood with lignin nanoparticles prior carbonization. Neglectable reflectivity from the visible to infrared wavelengths is obtained by combining thin nanostructures originated from the wood cell walls with long‐range microcavities in the wood lumina.
Bin Zhao   +7 more
wiley   +1 more source

Near‐Field Optical Detection of Defect‐Stabilized Metallic Islands at the Verwey Transition in Fe3O4

open access: yesAdvanced Functional Materials, EarlyView.
Nanoscale metallic islands emerging across the Verwey transition in thin films of Fe3O4 are imaged using near‐field optical microscopy from mid‐infrared to terahertz frequencies. Recurring across thermal cycles, these disorder‐stabilized islands exhibit distinct transition temperatures.
Kajal Tiwari   +4 more
wiley   +1 more source

Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs

open access: yesMathematics
This 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

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

open access: yes, 2011
In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity.
Angel, Omer   +2 more
core   +1 more source

Spanning Trees and Spanners [PDF]

open access: yes, 2000
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
openaire   +2 more sources

Beyond the Beam: Exploring Charged Particle Nanoprinting

open access: yesAdvanced Functional Materials, EarlyView.
Charged particle nanoprinting using electrons and ions is highly advanced, offering great potential for research and industry. However, challenges in precursor design and process optimization persist, but also offer great opportunities to drive nanofabrication innovations.
Nicolas Paul Jochmann   +2 more
wiley   +1 more source

Invasion percolation and global optimization

open access: yes, 1996
Invasion bond percolation (IBP) is mapped exactly into Prim's algorithm for finding the shortest spanning tree of a weighted random graph. Exploring this mapping, which is valid for arbitrary dimensions and lattices, we introduce a new IBP model that ...
Barabás, Albert-László
core   +1 more source

Asymptotic Enumeration of Spanning Trees [PDF]

open access: yesCombinatorics, Probability and Computing, 2005
We give new formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay [Europ. J. Combin. 4 149–160] for regular graphs. The general answer involves a quantity for infinite graphs that we call ‘tree entropy’, which we show is a logarithm of a normalized determinant of the graph Laplacian ...
openaire   +4 more sources

Artificial Intelligence‐Driven Development in Rechargeable Battery Materials: Progress, Challenges, and Future Perspectives

open access: yesAdvanced Functional Materials, EarlyView.
AI is transforming the research paradigm of battery materials and reshaping the entire landscape of battery technology. This comprehensive review summarizes the cutting‐edge applications of AI in the advancement of battery materials, underscores the critical challenges faced in harnessing the full potential of AI, and proposes strategic guidance for ...
Qingyun Hu   +5 more
wiley   +1 more source

The Budgeted Labeled Minimum Spanning Tree Problem

open access: yesMathematics
In order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs.
Raffaele Cerulli   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy