Results 101 to 110 of about 453 (193)
Journal of the American Ceramic Society, Volume 109, Issue 6, June 2026.ABSTRACT This paper presents a comprehensive study on the machining simulation of recrystallized silicon carbide (R‐SiC), with a focus on material failure mechanisms, numerical influences, tool kinematics, and frictional behavior. A representative volume of interest was derived from CT data, and a meshing algorithm for CT‐based structures was ...
Simon Unseld +4 more
wiley +1 more source
Maximum Vertex-Weighted Matching in Strongly Chordal Graphs
, 2008 Given a graph G = (V; E) and a real weight for each vertex of G, the vertex-weight of a matching is defined to be the sum of the weights of the vertices covered by the matching.
Sulamita Klein, Manoel B. Campelo Neto
core
Journal of Cellular and Molecular Medicine, Volume 30, Issue 11, June 2026.ABSTRACT Colorectal cancer (CRC) is one of the most common malignancies worldwide and remains a major cause of cancer‐related mortality. Increasing evidence suggests that aberrant RNA metabolism contributes to tumour initiation, progression and therapeutic resistance.
Fandong Kong +6 more
wiley +1 more source
Strongly pancyclic and dual-pancyclic graphs
, 2009 Say that a cycle C almost contains a cycle C¯ if every edge except one of C¯ is an edge of C. Call a graph G strongly pancyclic if every nontriangular cycle C almost contains another cycle C¯ and every nonspanning cycle C is almost contained in another ...
McKee, Terry
core +1 more source
Plant Biotechnology Journal, Volume 24, Issue 6, Page 4263-4281, June 2026.ABSTRACT Mentha spicata L. (spearmint) is a high‐value aromatic and medicinal species, whose productivity is strongly affected by water deficit. Nevertheless, the molecular mechanisms underlying drought acclimation in this mint remain largely unexplored. Thus, here, we investigated the microRNA‐mediated regulatory processes triggered in M.
Alessia D'Agostino +7 more
wiley +1 more source
, 1990 The quest for efficient parallel algorithms for graph related problems necessitates not only fast computational schemes but also requires insights into their inherent structures that lend themselves to elegant problem solving methods.
Radhakrishnan, Sridhar
core +1 more source
Thurston norm for coherent right‐angled Artin groups via L2$L^2$‐invariants
Journal of Topology, Volume 19, Issue 2, June 2026.Abstract We define a new notion of splitting complexity for a group G$G$ along a non‐trivial integral character ϕ∈H1(G;Z)$\phi \in H^1(G; \mathbb {Z})$. If G$G$ is a one‐ended coherent right‐angled Artin group, we show that the splitting complexity along an epimorphism ϕ:G→Z$\phi \colon G \rightarrow \mathbb {Z}$ equals the L2$L^2$‐Euler characteristic
Monika Kudlinska
wiley +1 more source
Finding Dominating Cliques Efficiently, in Strongly Chordal Graphs and Undirected Path Graphs
Discrete Mathematics, 1990 A set of vertices in a graph is called a dominating set if every vertex not in the set is adjacent to at least one vertex in the set. A dominating clique is a dominating set that induces a complete subgraph. The problem of locating a dominating clique of minimum cardinality is known to be NP-complete for general chordal graphs.
openaire +1 more source
Subgraph trees in graph theory
, 2003 The classical clique tree approach to chordal graphs (and, more recently, to strongly chordal graphs) can be generalized to show a common structure for other classes of graphs, including clique graphs of chordal graphs, outerplanar graphs, distance ...
Terry A. McKee, McKee, Terry A.
core +1 more source
ChoCo: a Chord Corpus and a Data Transformation Workflow for Musical Harmony Knowledge Graphs. [PDF]
Sci Data, 2023 de Berardinis J +3 more
europepmc +1 more source