Results 71 to 80 of about 12,115 (251)
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peled, Uri N., Rotics, Udi
openaire +1 more source
Advanced Science, EarlyView.A tri‐component biomimetic bioink(gelatin/alginate/fibrinogen) is developed to protect cells in critical pathological environments in AD. Using this bioink, a 3D‐printed NPC construct optimized for hippocampal transplantation is provided to improve cell retention and differentiation in an AD‐like model. This approach enhances memory recovery and offers
Ke Gai +12 more
wiley +1 more source
The leafage of a chordal graph
, 1998 The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes.
Lin, In-Jen +2 more
core +3 more sources
Electronic Notes in Discrete Mathematics, 2011 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
Clique Graphs of Chordal and Path Graphs [PDF]
SIAM Journal on Discrete Mathematics, 1994 Clique graphs of chordal and (undirected) path graphs are characterized. The clique graph of a graph \(G\) is the intersection graph of maximal cliques of \(G\). A chordal graph is the intersection graph of subtrees of a tree. A path graph is the intersection graph of paths of a tree. (Given a family \(F\) of subsets, the intersection graph of \(F\) is
Szwarcfiter, Jayme L. +1 more
openaire +2 more sources
Carpathian Journal of Mathematics, 2021 Triangulated graphs have many interesting properties (perfection, recognition algorithms, combinatorial optimization algorithms with linear complexity). Hyper-triangulated graphs are those where each induced subgraph has a hyper-simplicial vertex. In this paper we give the characterizations of hyper-triangulated graphs using an ordering of vertices and
openaire +1 more source
Advanced Science, EarlyView.Tooth decay progression transforms the dental pulp response from repair to fibrosis. At early stages, stromal cells reprogram to repair the extra cellular matrix (ECM), blood vessels, and nerves, remodel and grow, keeping repair possible. In advanced decay, hypoxia, and vessel regression, in complement with an immune switch, fuel nerve degeneration and
Hoang Thai Ha +12 more
wiley +1 more source
A new method for computing the vertex PI index with applications to special classes of graphs
AKCE International Journal of Graphs and CombinatoricsThe Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju +2 more
doaj +1 more source
Learning Inclusion-Optimal Chordal Graphs
, 2008 Appears in Proceedings of the Twenty-Fourth Conference on Uncertainty in Artificial Intelligence (UAI2008)
Auvray, Vincent, Wehenkel, Louis
openaire +3 more sources
Advanced Science, EarlyView.This study successfully engineered vascularized liver organoids (3HLOs) by co‐culturing human reprogrammed hepatocyte‐like cells (hrHLs) with human umbilical vein endothelial cells (HUVECs) and human umbilical mesenchymal stem cells (HUMSCs). Upon implantation, the 3HLOs established functional vascular anastomosis with the host circulation and ...
Kangdi Yang +13 more
wiley +1 more source