Results 81 to 90 of about 1,503,165 (299)
On $[1,2]$-Domination in Interval and Circle Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA subset $S$ of vertices in a graph $G=(V, E)$ is a Dominating Set if each vertex in $V(G)\setminus S$ is adjacent to at least one vertex in $S$. Chellali et al.
Mohsen Alambardar Meybodi +1 more
doaj +1 more source
Robust maximum weighted independent-set problems on interval graphs. [PDF]
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core
FEBS Open Bio, EarlyView.Hyperosmotic stress triggers the relocation of the CFIm complex from the nucleus to the cytoplasm. This shift creates a nuclear ‘stoichiometric bottleneck’, limiting CFIm availability for mRNA processing. Consequently, specific mRNAs like NUDT21 and DICER1 undergo targeted 3′UTR shortening, demonstrating how spatial protein dynamics drive rapid ...
Hitomi Soumiya +2 more
wiley +1 more source
The upper chromatic number of quasi-interval co-hypergraphs
Le Matematiche, 1997 We investigate the structural and colouring properties of clique hyper-graphs of interval graphs called the quasi-interval hypergraphs. We find the conditions when they are interval hypergraphs. The upper chromatic number for the clique co-hypergraphs of
Violeta Prisakaru
doaj
Transit functions on graphs (and posets) [PDF]
The notion of transit function is introduced to present a unifying approachfor results and ideas on intervals, convexities and betweenness in graphs andposets.
Mulder, H.M.
core
Evaluating the involvement of autolysosomes in the nuclear translocation of fluorescent proteins
FEBS Open Bio, EarlyView.Endogenously expressed fluorescent proteins can be degraded by autophagy and transported to cell nuclei via the nuclear pore complex. But in some cell lines, for example, HeLa cells which are positive for immunoreactivity of a receptor ligand, such as UCN I, in cell nuclei, fusion of autolysosome with the nuclear envelope is involved in the nuclear ...
Keiichi Ikeda
wiley +1 more source
Discrete Mathematics, 1979 AbstractA base of the cycle space of a binary matroid M on E is said to be convex if its elements can be totally ordered in such a way that for every e ε E the set of elements of the base containing e is an interval. We show that a binary matroid is cographic iff it has a convex base of cycles; equivalently, graphic matroids can be represented as ...
openaire +2 more sources
Theoretical Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Naoto Miyoshi +3 more
openaire +2 more sources
Median computation in graphs using consensus strategies [PDF]
Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of profiles.
Changat, M. +2 more
core
Loss of AMBRA1 activates MAPK and angiogenesis signaling pathways in melanoma cells
FEBS Open Bio, EarlyView.Loss of AMBRA1 in melanoma cells activates multiple oncogenic pathways associated with tumor progression. Transcriptomic and protein network analyses revealed that AMBRA1 depletion enhances MAPK/ERK signaling, angiogenesis, TGF‐β/EMT signaling, and Wnt/axon guidance pathways.
Milad Ibrahim +4 more
wiley +1 more source