Results 71 to 80 of about 190,829 (309)
Graph colourings and partitions
Theoretical Computer Science, 2001 The author considers three coloring-related parameters of finite simple undirected graphs: the chromatic, achromatic and pseudochromatic numbers. The chromatic number is the minimum number of colors needed to color the vertices of \(G\) in such a way that adjacent vertices receive different colors.
openaire +2 more sources
Resolving dominating partitions in graphs [PDF]
Discrete Applied Mathematics, 2019 A partition $ =\{S_1,\ldots,S_k\}$ of the vertex set of a connected graph $G$ is called a \emph{resolving partition} of $G$ if for every pair of vertices $u$ and $v$, $d(u,S_j)\neq d(v,S_j)$, for some part $S_j$. The \emph{partition dimension} $ _p(G)$ is the minimum cardinality of a resolving partition of $G$.
Hernando Martín, María del Carmen +2 more
openaire +5 more sources
Molecular Oncology, EarlyView.This study highlights the importance of multi‐omic analyses in characterizing colorectal cancers. Indeed, our analysis revealed a rare CMS1 exhibiting dampened immune activation, including reduced PD‐1 expression, moderate CD8+ T‐cell infiltration, and suppressed JAK/STAT pathway.
Livia Concetti +10 more
wiley +1 more source
PACC: Large scale connected component computation on Hadoop and Spark.
PLoS ONE, 2020 A connected component in a graph is a set of nodes linked to each other by paths. The problem of finding connected components has been applied to diverse graph analysis tasks such as graph partitioning, graph compression, and pattern recognition. Several
Ha-Myung Park +3 more
doaj +1 more source
A modified multilevel k-way partitioning algorithm for trip-based road networks [PDF]
MATEC Web of Conferences, 2019 In today’s world, the traffic volume on urban road networks is multiplying rapidly due to the heavy usage of vehicles and mobility on demand services. Migration of people towards urban areas result in increasing size and complexity of urban road networks.
Withanage C +5 more
doaj +1 more source
Molecular Oncology, EarlyView.Overexpression of CHRDL2 in colon cancer cells makes them more stem‐like and resistant to chemo‐ and radiotherapy. CHRDL2‐high cells have upregulation of the WNT pathway, genes involved in the DNA damage response (DDR) pathway and epithelial‐to‐mesenchymal transition (EMT). This leads to quicker repair of damaged DNA and more cell migration.
Eloise Clarkson, Annabelle Lewis
wiley +1 more source
Isoperimetric Partitioning: A New Algorithm for Graph Partitioning [PDF]
, 2003 Temporal structure is skilled, fluent action exists at several nested levels. At the largest scale considered here, short sequences of actions that are planned collectively in prefronatal cortex appear to be queued for performance by a cyclic competitive
Grady, Leo, Schwartz, Eric
core +1 more source
Decrypting cancer's spatial code: from single cells to tissue niches
Molecular Oncology, EarlyView.Spatial transcriptomics maps gene activity across tissues, offering powerful insights into how cancer cells are organised, switch states and interact with their surroundings. This review outlines emerging computational, artificial intelligence (AI) and geospatial approaches to define cell states, uncover tumour niches and integrate spatial data with ...
Cenk Celik +4 more
wiley +1 more source
Community detection and graph partitioning
, 2013 Many methods have been proposed for community detection in networks. Some of the most promising are methods based on statistical inference, which rest on solid mathematical foundations and return excellent results in practice.
Newman, M. E. J.
core +1 more source
Survivin and Aurora Kinase A control cell fate decisions during mitosis
Molecular Oncology, EarlyView.Aurora A interacts with survivin during mitosis and regulates its centromeric role. Loss of Aurora A activity mislocalises survivin, the CPC and BubR1, leading to disruption of the spindle checkpoint and triggering premature mitotic exit, which we refer to as ‘mitotic slippage’.
Hana Abdelkabir +2 more
wiley +1 more source