Results 91 to 100 of about 327 (176)
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
ABSTRACT We continue the study of ( tw , ω )‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel ...
Claire Hilaire +2 more
wiley +1 more source
Generative Artificial Intelligence and Large Language Models in Clinical Oncology
By integrating multimodal data, including medical imaging, pathology, omics, and electronic health records, generative AI and LLMs support cancer diagnosis, treatment planning, and follow‐up management. These technologies also enhance physician–patient communication, improve personalized treatment strategies, and leverage intelligent agent automation ...
Yunfang Yu +14 more
wiley +1 more source
Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)
In his Ph.D. thesis, Farber proved that every strongly chordal graph can be represented as intersection graph of subtrees of a weighted tree, and these subtrees are ``compatible''. Moreover, this is an equivalent characterization of strongly chordal graphs. To my knowledge, Farber never published his results in a conference or a journal, and the thesis
openaire +2 more sources
In vitro and in vivo effects of PTSO in colorectal cancer preclinical models, highlighting antiproliferative, pro‐apoptotic, barrier‐enhancing, antitumor, prebiotic and immunomodulatory properties. Created using BioRender. ABSTRACT Allium‐derived organosulfur compounds offer significant health benefits.
María Jesús Rodríguez‐Sojo +16 more
wiley +1 more source
Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs
This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees for unbounded k.
openaire
Abstract Flood governance often operates as a polycentric network where authority, resources, and responsibilities are distributed across multiple organizations, yet the structural and cognitive factors that shape collaboration remain underexplored in flood contexts.
Koorosh Azizi +2 more
wiley +1 more source
Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]
Afridi MUK, Rehman IU, Ishaq M.
europepmc +1 more source
This 15‐year bibliometric study (2009–2024) characterizes the global landscape of liquid–liquid phase separation (LLPS) in neurodegenerative diseases. We delineate the field's evolution from fundamental biophysics to clinical translation, emphasizing the liquid‐to‐solid transition of proteins like TDP‐43, tau, and α‐synuclein.
Chanyuan Zhang +6 more
wiley +1 more source
Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]
Röttger F, Kahle T, Schwabe R.
europepmc +1 more source
We investigated how English‐speakers from North America and the United Kingdom and Mandarin‐speakers from China map musical intervals onto sensory and emotional dimensions. Across vision, touch, taste, and affect, consonant intervals were consistently linked to positive, smooth, warm, and bright qualities, whereas dissonant intervals were associated ...
Nicola Di Stefano +6 more
wiley +1 more source

