Results 91 to 100 of about 1,814,953 (245)
Polyhedral Computations for the Simple Graph Partitioning Problem [PDF]
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal.
Sørensen, Michael M.
core
Graph Classes Closed Under Self-Intersection [PDF]
A graph class is monotone if it is closed under taking subgraphs. A monotone class defined by finitely many obstructions has bounded treewidth if and only if one of the obstructions is a tripod, i.e. a disjoint union of subdivided claws and paths.
Zamaraev, Viktor +5 more
core +1 more source
Classes of Graphs That Are Not Cohen–Macaulay Classes
Ukrainian Mathematical JournalUDC 512.5 Characterizations of the classes of Cohen–Macaulay graphs are important because when we characterize one of these classes, then we can decide whether a ring of the form $\mathbb{K}[x_1,\ldots,x_n]/I$ is Cohen–Macaulay or not, where $I$ is a square-free monomial ideal. For a given commutative ring $R$, the total graph of $R$ is a simple graph
T. Asir, T. Ashitha
openaire +1 more source
Oncogenic DMTF1β promotes cancer cell motility by regulating autophagy through ULK1 stabilization
Molecular Oncology, EarlyView.In the current study, we demonstrate that the oncogene DMTF1β regulates ULK1 stability by reducing its proteasomal degradation in cancer cells. This stabilization enables ULK1 to induce autophagy, which in turn facilitates cancer cell migration. Consequently, reduced DMTF1β levels lead to decreased autophagy and impaired cancer cell migration.
Jun Xu +13 more
wiley +1 more source
Graph-based implicit knowledge discovery from architecture change logs [PDF]
, 2012 Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344) +12 more
core +2 more sources
On the Size of Hereditary Classes of Graphs
Journal of Combinatorial Theory, Series B, 1994 For a hereditary property \(\mathcal P\) (closed under taking induced subgraphs), let \({\mathcal P}_ n\) denote the \(\mathcal P\) graphs on \(n\) labelled vertices. The growth of \(| {\mathcal P}_ n |\) is studied, and it is shown that certain growth rates are not possible.
Edward R. Scheinerman, Jennifer S. Zito
openaire +3 more sources
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Discrete Mathematics, 2000 AbstractConsider the following total order: order the vertices by repeatedly removing a vertex of minimum degree in the subgraph of vertices not yet chosen and placing it after all the remaining vertices but before all the vertices already removed. For which graphs the greedy algorithm on this order gives an optimum vertex-coloring?
Celina M. H. de Figueiredo +1 more
openaire +2 more sources
Molecular Oncology, EarlyView.Breast cancer remains a major cause of cancer death in women, frequently developing endocrine therapy resistance. This study demonstrates that upregulated p21‐activated kinase 1 (PAK1) activity drives resistance to tamoxifen and long‐term estrogen deprivation in ER+ breast cancer models.
Luisa Schwarzmüller +10 more
wiley +1 more source
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source