Results 11 to 20 of about 448,992 (178)
Modular Decomposition and the Reconstruction Conjecture [PDF]
, 2012 We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.Comment: 9 pages, 2 ...
Brignall, Robert +2 more
core +3 more sources
Partitioning Perfect Graphs into Stars
, 2016 The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three
Bredereck, Robert +6 more
core +2 more sources
Automorphism Groups of Geometrically Represented Graphs [PDF]
, 2015 We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations.
Klavík, Pavel, Zeman, Peter
core
Social context prevents heat hormetic effects against mutagens during fish development
FEBS Letters, EarlyView.This study shows that sublethal heat stress protects fish embryos against ultraviolet radiation, a concept known as ‘hormesis’. However, chemical stress transmission between fish embryos negates this protective effect. By providing evidence for the mechanistic molecular basis of heat stress hormesis and interindividual stress communication, this study ...
Lauric Feugere +5 more
wiley +1 more source
A new graph perspective on max-min fairness in Gaussian parallel channels
, 2008 In this work we are concerned with the problem of achieving max-min fairness in Gaussian parallel channels with respect to a general performance function, including channel capacity or decoding reliability as special cases.
Boche, Holger, Wiczanowski, Marcin
core +2 more sources
Molecular Oncology, EarlyView.This study identifies nuclear YB‐1 S102 phosphorylation as a marker associated with KRAS and FBXW7 mutations in colorectal cancer. Mutated KRAS correlates specifically with nuclear, not cytoplasmic, S102 YB‐1. These findings provide the first ex vivo evidence of this link in CRC and suggest future studies should assess the prognostic and therapeutic ...
Konstanze Lettau +9 more
wiley +1 more source
Journal of Graph Algorithms and Applications, 2017 This is the first of two chapters of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) model ${\mathcal{M}}$ is given and the goal is to obtain an equivalent UCA model ${\mathcal{U}}$. In
openaire +4 more sources
On singular probability densities generated by extremal dynamics
, 2004 Extremal dynamics is the mechanism that drives the Bak-Sneppen model into a (self-organized) critical state, marked by a singular stationary probability density $p(x)$.
Bak +23 more
core +1 more source
Molecular Oncology, EarlyView.Human cytomegalovirus infection is common in normal prostate epithelium, prostate tumor tissue, and prostate cancer cell lines. CMV promotes cell survival, proliferation, and androgen receptor signaling. Anti‐CMV pharmaceutical compounds in clinical use inhibited cell expansion in prostate cancer models in vitro and in vivo, motivating investigation ...
Johanna Classon +13 more
wiley +1 more source
A Graph Theory Approach for Regional Controllability of Boolean Cellular Automata
, 2019 Controllability is one of the central concepts of modern control theory that allows a good understanding of a system's behaviour. It consists in constraining a system to reach the desired state from an initial state within a given time interval. When the
Bagnoli, Franco +3 more
core +1 more source