Results 121 to 130 of about 587,547 (217)

Embedding meshes and TORUS networks onto degree-four chordal rings [PDF]

, 2012
[[abstract]]Degree-four chordal rings demonstrate many attractive properties, such as node symmetry, constant degree, O(√N) diameter and the ability to interconnect an arbitrary number of nodes.
Fang, J. F. ; Hsiao, Ju-Yuan; Tang, C. Y.
core  

Maternal protein restriction programs the ageing kidney: Proteomic signatures of early‐life origin renal and metabolic dysfunction

The Journal of Physiology, EarlyView.
Abstract figure legend Maternal protein restriction (MPR) induced persistent renal histopathological alterations accompanied by elevated serum creatinine levels. Nephron‐segment proteomic analysis revealed region‐specific molecular dysregulation affecting Bowman's capsule (PARK7, oxidative stress sensor; MSN, cytoskeletal organization), the proximal ...
Marina Pereira Pires, Matheus Naia Fioretto, Marcel Rodrigues Ferreira, Isabelle Tenori Ribeiro, Luísa Annibal Barata, Flávia Alessandra Maciel, Lucas Sobrinho Lemos, Renato Mattos, Luiz Marcos Frediane Portela, Patrick Vieira de Souza, Luisa Correia Gomes, Gustavo Monezzi Cordeiro, Wellerson Rodrigo Scarano, Patrícia Aline Boer, Jose Antonio Rocha Gontijo, Luis Antonio Justulin   +15 more
wiley   +1 more source

Hendry\u27s Conjecture on Chordal Graph Subclasses

, 2017
A cycle is extendable if there exists another cycle on the same set of vertices plus one more vertex. G.R.T. Hendry conjectured (1990) that every non spanning cycle in a Hamiltonian chordal graph is extendable.

core  

Big Data in Cancer Genomics: Computational Foundations and Emerging Pathways for Precision Oncology

Computational and Systems Oncology, Volume 6, Issue 1, December 2026.
ABSTRACT This review aims to explore the computational foundations of big data in cancer genomics and examine emerging pathways that support precision oncology and personalized cancer care. A narrative review approach was adopted to synthesize evidence from PubMed, Scopus, Web of Science, and IEEE Xplore.
Nur Vanu, Nur Mohammad, Fahad Ahmed, Towsif Alam, Koushik Saha, Durga Shahi, Adib Hossain, Mia Md. Tofayel Gonee Manik, Mst. Rina Parvin   +8 more
wiley   +1 more source

Dual Formulation of the Chordal Graph Conjecture

, 2020
The idea of an integer linear programming approach to structural learning of decomposable graphical models led to the study of the so-called chordal graph polytope.
Kratochvíl, Václav, Studený, Milan, Cussens, James   +2 more
core  

p‐Brain: A Modular Open‐Source Framework for Automated Quantitative DCE‐MRI of Cerebral Perfusion, Microvasculature, and Blood–Brain Barrier Permeability

Magnetic Resonance in Medicine, Volume 96, Issue 6, Page 2601-2614, December 2026.
ABSTRACT We present p‐Brain, a modular, open‐source framework for reproducible, automated quantitative DCE‐MRI at scale. Rather than a fixed pipeline, p‐Brain is built from interchangeable stages (ingestion, T1/M0$$ {T}_1/{M}_0 $$ fitting, vascular and tissue ROI extraction, signal‐to‐concentration conversion, kinetic modeling, and quality control ...
Edis D. Tireli, Stig P. Cramer, Ulrich Lindberg, Derya Tireli, Mark B. Vestergaard, Henrik B. W. Larsson   +5 more
wiley   +1 more source

Global Graph Surrogates and Neural Graph Elements for Computational Mechanics

Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 4, December 2026.
ABSTRACT Machine learning surrogates are increasingly used to accelerate physics‐based simulations by predicting full‐field responses at a fraction of the computational cost. In this contribution, we present two complementary graph‐based approaches for surrogate modelling in computational mechanics.
Rutwik Gulakala, Marcus Stoffel
wiley   +1 more source

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

Journal of Graph Theory, Volume 113, Issue 3, Page 411-427, November 2026.
ABSTRACT A (2‐dimensional) realisation of a graph G is a pair ( G , p ), where p maps the vertices of G to R 2. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise. We say that G is rigid if every generic realisation of G is rigid; otherwise, G is flexible. In this paper, we investigate
Katie Clinch, Dániel Garamvölgyi, John Haslegrave, Tony Huynh, Jan Legerský, Anthony Nixon   +5 more
wiley   +1 more source

Weak Degeneracy of Planar Graphs

Journal of Graph Theory, Volume 113, Issue 3, Page 399-410, November 2026.
ABSTRACT The weak degeneracy of a graph G is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d‐degenerate graph is weakly d‐degenerate, but the converse is not true in general (e.g., all connected d‐regular graphs except cycles and cliques
Anton Bernshteyn, Eugene Lee, Evelyne Smith‐Roberge   +2 more
wiley   +1 more source

A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs

Journal of Graph Theory, Volume 113, Issue 3, Page 462-469, November 2026.
ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley   +1 more source