Results 121 to 130 of about 3,864 (298)
Partitions of Vertices and Facets in Trees and Stacked Simplicial Complexes [PDF]
For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes with their triangulations), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices ...
Fløystad, Gunnar
core +1 more source
2K2 vertex-set partition into nonempty parts
Electronic Notes in Discrete Mathematics, 2008 Abstract A graph is 2K2-partitionable if its vertex set can be partitioned into four nonempty parts A, B, C, D such that each vertex of A is adjacent to each vertex of B, and each vertex of C is adjacent to each vertex of D. Determining whether an arbitrary graph is 2K2-partitionable is the only vertex-set partition problem into four nonempty parts ...
Simone Dantas +4 more
openaire +1 more source
Advanced Science, EarlyView.Brown adipocyte sheets are engineered to protect the heart against myocardial ischemia–reperfusion injury by restraining ferroptosis. Upon transplantation onto the cardiac surface, they improve cardiac function, limit infarction and fibrosis, and enhance angiogenesis.
Lifu Sun +6 more
wiley +1 more source
Multi-Level Refinement Algorithm of Weighted Hypergraph Partitioning Problem
Journal of Intelligent Systems, 2017 The formal description of weighted hypergraph partitioning problem is presented. We describe the solution of the weighted hypergraph partitioning problem based on the multi-level method.
Leng Ming, Sun Ling-yu, Guo Kai-qiang
doaj +1 more source
A note on the computational complexity of graph vertex partition
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuanqiu Huang, Yuming Chu
openaire +2 more sources
Advanced Science, EarlyView.STAID is a unified deep learning framework that couples iterative pseudo‐spot refinement with neural network training through a feedback loop and exploits gene co‐expression information to model higher‐order interactions, achieving accurate and robust cell‐type deconvolution in spatial transcriptomics.
Jixin Liu +5 more
wiley +1 more source
Journal of Graph Algorithms and ApplicationsThe 2-blowup of a graph is obtained by replacing each vertex with two non-adjacent copies; a graph is biplanar if it is the union of two planar graphs. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar: iterated Kleetopes ...
David Eppstein
doaj +1 more source
Making Sweat Measurable: Induction, Sampling, and Refreshment in Wearable Biofluid Sensing
Advanced Science, EarlyView.Wearable sweat sensing relies not only on chemical detection but also on controlled biofluid management. This Review integrates sweat physiology, induction strategies, and microfluidic sampling architectures, demonstrating how flux, transport, and refreshment shape measurement reliability.
Soyoung Shin, Wei Gao
wiley +1 more source
Quasi-randomness and algorithmic regularity for graphs with general degree distributions [PDF]
, 2010 We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to express how much a given graph “resembles” a random one.
Schacht, Mathias +5 more
core +1 more source
Topology‐Aware Deep Learning on Higher‐Order Structures for Drug Response Prediction
Advanced Science, EarlyView.We present TopDr, a topology‐aware deep learning framework that encodes both drugs and cell lines as multiscale simplicial complexes, capturing interactions at the 0‐, 1‐, and 2‐simplex levels. By jointly integrating local higher‐order neighborhoods and global topological structures, TopDr generates enriched representations for sensitivity prediction ...
Cong Shen +3 more
wiley +1 more source