Results 121 to 130 of about 973,826 (351)
Spin Transport Across Interfaces With the Non‐Collinear Antiferromagnet Mn3Sn
Advanced Materials, EarlyView.We study spin transport with Mn3Sn|Metal${\rm Mn}_3{\rm Sn}\vert{\rm Metal}$ heterostructures. For Mn3Sn|Pt${\rm Mn}_3{\rm Sn}\vert{\rm Pt}$ heterostructures, ultrafast spin current generation by optical pumping of Mn3Sn${\rm Mn}_3{\rm Sn}$ is explored, while for Mn3Sn|NiFe${\rm Mn}_3{\rm Sn}\vert{\rm NiFe}$ heterostructures, we probe the spin–charge ...
Paul A. Marschall +8 more
wiley +1 more source
Joshua H. Perfect Civil War letter
This collection contains a letter written at Helena, Ark., by Joshua Perfect of Company G, 46th Indiana Infantry, to his mother and father at Seafield in White County ...
Perfect, Joshua H., 1843-1864
core +1 more source
Computing a Clique Tree with the Algorithm Maximal Label Search
Algorithms, 2017 The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Search (
Anne Berry, Geneviève Simonet
doaj +1 more source
On clique-perfect and K-perfect graphs.
Ars Comb., 2006 80
Bonomo, Flavia +3 more
openaire +5 more sources
Inverse Design of Nanoparticulate Materials
Advanced Materials, EarlyView.Inverse design shifts nanomaterial development from empirical trial‐and‐error to predictive model‐driven strategies. It can rely on knowledge‐based, data‐based, or hybrid process and property functions. This perspective article provides a practical framework for applying inverse design based on instructive examples. It discusses which modeling approach
Nabi Etienne Traoré +5 more
wiley +1 more source
Advanced Materials Interfaces, EarlyView.Atomistic simulations reveal the interlayer mechanics of additively manufactured materials, showing how build direction and layer interfaces govern diffusion, defect evolution, and mechanical strength. Distinct anisotropic behavior arises from interface‐controlled deformation and dislocation activity, establishing critical links between microstructural
Rohit Singh, Jinoop Arackal Narayanan
wiley +1 more source
A new decomposition theorem for Berge graphs [PDF]
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that ...
Nicolas Trotignon
core
Graph Algorithm Animation with Grrr [PDF]
, 2000 We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers +3 more
core +1 more source
Large‐Area Flat Optics Color Routing in Tilted Arrays of 2D Semiconductor Nanostripes
Advanced Optical Materials, EarlyView.We develop a scalable flat optics platform exploiting self‐organised ion‐beam sputtering and maskless glancing‐angle deposition to fabricate centimetre‐scale arrays of tilted MoS2 nanostripes. The engineered geometry activates Rayleigh anomalies, guided modes, and Mie resonances, enabling highly directional color routing and enhanced light harvesting ...
Simone Di Marco +7 more
wiley +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core