Results 81 to 90 of about 973,826 (351)
Effects of Mg on Microstructure and Solidification of a Hypereutectic Zn–8 wt.%Al Alloy
Advanced Engineering Materials, EarlyView.An appreciable set of results involving thermal data, microstructure, chemical composition, and microstructural growth laws is reported for ZnAlMg alloys. Such results demonstrate that ZnAlMg alloys have high potential for applications in automotive self‐lubricating components, batteries, and electrical systems.
Raí B. de Sousa +6 more
wiley +1 more source
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
, 2010 An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
Graph-based implicit knowledge discovery from architecture change logs [PDF]
, 2012 Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344) +12 more
core +2 more sources
Laser‐Induced Graphene from Waste Almond Shells
Advanced Functional Materials, EarlyView.Almond shells, an abundant agricultural by‐product, are repurposed to create a fully bioderived almond shell/chitosan composite (ASC) degradable in soil. ASC is converted into laser‐induced graphene (LIG) by laser scribing and proposed as a substrate for transient electronics.
Yulia Steksova +9 more
wiley +1 more source
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
Electronic Notes in Discrete Mathematics, 2002 Abstract A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H). The Strong Perfect Graph Conjecture (SPGC) states: An undirected graph is perfect if and only if neither G nor its complement G contains, as an induced subgraph, a chordless cycle whose length is odd and ...
Agnes V. Dizon-Garciano +2 more
openaire +1 more source
Advanced Functional Materials, EarlyView.ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti +16 more
wiley +1 more source
Generalized Matching Preclusion in Bipartite Graphs
Theory and Applications of Graphs, 2018 The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Zachary Wheeler +4 more
doaj +1 more source
Memristive‐Gated RC‐Delay Synaptic Transistors for Time‐Encoded Analog in‐Memory Computing
Advanced Functional Materials, EarlyView.A Memristive‐Gated Transistor for Time‐Encoded Analog In‐Memory Computing — By exploiting the RC delay of a self‐rectifying interface‐type memristor, nonlinear I–V distortion is structurally bypassed, enabling 3‐bit nonvolatile memory, spike‐timing‐based analog encoding, and hardware‐calibrated reservoir‐computing validation within a unified device ...
Yun‐Seo Shin +7 more
wiley +1 more source
Pragmatic Graph Rewriting Modifications [PDF]
, 1999 We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter +3 more
core +1 more source