Results 101 to 110 of about 4,256 (307)

Graph colouring: a visual tour [PDF]

open access: yes
Graph colouring is a combinatorial optimisation problem with applications in several important domains, including sports scheduling, cartography, street map navigation, and timetabling.
Lewis, Rhydian
core   +1 more source

DLR group presentation + Measurement-based Graph Colouring [PDF]

open access: yes, 2022
A short introduction to the quantum computing group at the Institute for Software technology, followed by a talk about our graph colouring ...
Epping, Michael
core  

Epigenetic silencing of the liver‐specific lncRNA LUNAR promotes liver cancer progression via NOTCH activation

open access: yesMolecular Oncology, EarlyView.
LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang   +9 more
wiley   +1 more source

Optimalisasi Fase Dan Durasi Lampu Lalu Lintas Bundaran Digulis Pontianak

open access: yesJurnal Derivat
Digulis Roundabout Pontianak is one of the intersections that has a fairly heavy traffic flow that often causes congestion at this intersection. Therefore, it is necessary to optimise the phase and duration of traffic lights by applying fuzzy graph   to ...
Harry Evendy Sijabat   +2 more
doaj   +1 more source

A fuzzy irregular cellular automata-based method for the vertex colouring problem

open access: yesConnection Science, 2020
Vertex colouring is among the most important problems in graph theory which has been widely applied across different real-world problems. In vertex colouring problem (VCP), the goal is to assign a distinct colour to each vertex of the graph in such a way
Mostafa Kashani   +2 more
doaj   +1 more source

Online Graph Colouring [PDF]

open access: yes, 2004
This paper considers the problem of online graph colouring. An algorithm for vertex-colouring graphs is said to be online if each vertex is irrevocably assigned a colour before later vertices are considered.
Avery Miller
core  

Interferon beta drives therapy resistance in a patient‐derived model of high‐grade serous ovarian cancer

open access: yesMolecular Oncology, EarlyView.
Interferon type 1 (IFN‐1) production and signaling is associated with the acquisition of therapy resistance, following chronic DNA damage, via Interferon‐related DNA damage resistance signature (IRDS) gene expression. An alternative, DNA damage‐independent role of sustained IFN‐1 mediated resistance was identified and characterized by the emergence of ...
Ashlyn Conant   +11 more
wiley   +1 more source

Oriented Incidence Colourings of Digraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite graphs. Here we introduce a similar concept for digraphs and define the oriented incidence chromatic number.
Duffy Christopher   +3 more
doaj   +1 more source

Graph colourings and partitions

open access: yesTheoretical 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   +1 more source

Rainbow colouring of split graphs

open access: yesDiscrete Applied Mathematics, 2017
A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same. A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one rainbow path.
L. Sunil Chandran   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy