Results 81 to 90 of about 64,086 (307)
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
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
k-perfect geodominating sets in graphs [PDF]
Opuscula Mathematica, 2007 A perfect geodominating set in a graph \(G\) is a geodominating set \(S\) such that any vertex \(v \in V(G)\setminus S\) is geodominated by exactly one pair of vertices of \(S\).
Doost Ali Mojdeh, Nader Jafari Rad
doaj
Binding Number, Toughness and General Matching Extendability in Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A connected graph $G$ with at least $2m + 2n + 2$ vertices which contains a perfect matching is $E(m, n)$-{\it extendable}, if for any two sets of disjoint independent edges $M$ and $N$ with $|M| = m$ and $|N|= n$, there is a perfect matching $F$ in $G ...
Hongliang Lu, Qinglin Yu
doaj +1 more source
Advanced Functional Materials, EarlyView.Thermally oxidized MoS2‐based radio‐frequency switches enable a multifunctional platform that unifies broadband RF switching and in‐memory computation. The device achieves a cutoff frequency of 33.2 THz with high energy efficiency and supports hardware‐aware signal processing.
Juho Son +5 more
wiley +1 more source
A characterization of perfect graphs
Journal of Combinatorial Theory, Series B, 1972 AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less than the number of vertices holds for each induced subgraph. The fact, conjectured by Berge and proved by the author, follows immediately that the complement of a perfect graph is perfect.
openaire +2 more sources
Twin Crystal Moiré Metasurfaces for Crossing Flat‐Band Transport
Advanced Functional Materials, EarlyView.This study introduces twin crystal moiré metasurfaces, breaking in‐plane symmetry to enable reconfigurable acoustic wave manipulation. By adjusting the twin angle and interlayer twist angle, various combinations of hyperbolic, flat bands, and elliptic states can be synthesized in the system.
Shida Fan +9 more
wiley +1 more source
Alternating sign property of the perfect matching derangement graph
, 2023 It was conjectured in the monograph [9] by Godsil and Meagher and in the article [10] by Lindzey that the perfect matching derangement graph M2n possesses the alternating sign property, that is, for any integer partition λ=(λ1,…,λr)⊢n, the sign of the ...
Wong, Kok Bin +2 more
core +1 more source
Advanced Healthcare Materials, EarlyView.Human periosteum‐derived cell spheroids bioprinted at high density within a hyaluronic acid matrix promote fusion and hypertrophic cartilage formation in vitro. Early encapsulation enhances spheroid interaction and matrix maturation, generating scalable cartilage templates intended for endochondral bone regeneration.
Ane Albillos Sanchez +6 more
wiley +1 more source
Covering a cubic graph with perfect matchings
, 2013 Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them.
Mazzuoccolo, Giuseppe
core +1 more source