Results 61 to 70 of about 655,680 (212)
Tree-layout based graph classes: proper chordal graphs
Many standard graph classes are known to be characterized by means of layouts (a permutation of its vertices) excluding some patterns. Important such graph classes are among others: proper interval graphs, interval graphs, chordal graphs, permutation ...
Protopapas, Evangelos, Paul, Christophe
core +1 more source
A Transformer‐based AI framework, DLINP, screens millions of compounds to identify Co68, a cobalt‐pincer organometallic complex that biases TLR4‐MD2 signaling toward antitumor interferon activation while suppressing inflammatory toxicity through an early TLR4‐SYK‐STAT1 axis.
Xuefei Guo +10 more
wiley +1 more source
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
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
(i) Aging impairs peripheral nerve regeneration via its dual ferroptosis‐mediated pathologies in senescent schwann cells. (ii) The composite nerve conduit is a symbiosis niche integrating microenvironment‐responsive nanoparticles (Ga‐PTAs) and maxillofacial‐derived mesenchymal stem cells (Mmscs).
Ning Zhan +12 more
wiley +1 more source
On the shelling antimatroids of split graphs [PDF]
Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri N. Peled, Udi Rotics
openaire +2 more sources
In an invasive beetle–fungus complex, the mutualist Leptographium procerum induces host HSP83 and modulates Toll‐dependent antifungal immunity. HSP83 mediates two‐tiered control by associating with selected fungal recognition receptors and restraining Dorsal‐driven antimicrobial peptide transcription.
Qingtai Yang +8 more
wiley +1 more source
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +1 more source
Chordal multipartite graphs and chordal colorings
A graph is defined to be chordal colorable if it admits a proper vertex-coloring such that each minimal separator induces a subgraph in which two vertices are adjacent if and only if they are differently colored. All chordal graphs and all chordal bipartite graphs are chordal colorable. All chordal colorable graphs are weakly chordal.
openaire +1 more source
Matrix partition problems generalize graph colouring and homomorphism problems and occur frequently in the study of perfect graphs. It is difficult to decide, even for a small matrix M, whether the M-partition problem is polynomial time solvable or NP-complete (or possibly neither), and whether M-partitionable graphs can be characterized by a finite ...
Tomás Feder +2 more
openaire +1 more source

