Results 271 to 280 of about 4,256 (307)
The underperforming Abbott-Bioline Malaria Ag P.f/P.v rapid diagnostic test: a whiter shade of pale - where the truth is not plain to see. [PDF]
Malar JThein KS +11 more
europepmc +1 more source
Comparison of different silane primer systems on composite resin bond strength to lithium disilicate ceramics. [PDF]
Saudi Dent JDemir N, Uner AO, Ozturk SN.
europepmc +1 more source
The confounding effects of skin colour in photoacoustic imaging
Else TR +7 more
europepmc +1 more source
Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems [PDF]
European Journal of Operational Research, 2009 In this paper, we present a random iterative graph based hyper-heuristic to produce a collection of heuristic sequences to construct solutions of different quality.
Rong Qu, Edmund Burke, Barry Mccollum
exaly +3 more sources
Periodic assignment and graph colouring [PDF]
Discrete Applied Mathematics, 1994 We analyse the problem of executing periodic operations on a minimum number of identical processors under different constraints. The analysis is based on a reformulation of the problem in terms of graph colouring.
Jan Korst
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Information Processing Letters, 2000
The problem we are addressing in this paper was proposed at SIROCCO'98 by Kranakis, with possible applications to finding a consensus in distributive networks. The problem can be viewed as a simple game on graphs, in a way similar to the game of life.
Stefan Dobrev +3 more
openaire +1 more source
The problem we are addressing in this paper was proposed at SIROCCO'98 by Kranakis, with possible applications to finding a consensus in distributive networks. The problem can be viewed as a simple game on graphs, in a way similar to the game of life.
Stefan Dobrev +3 more
openaire +1 more source
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
Combinatorics, Probability and Computing, 1998For any integer k, we prove the existence of a uniquely k-colourable graph of girth at least g on at most k12(g+1) vertices whose maximal degree is at most 5k13. From this we deduce that, unless NP=RP, no polynomial time algorithm for k-Colourability on graphs G of girth g(G)[ges ]log[mid ]G[mid ]/13logk and maximum degree Δ(G ...
Thomas Emden-Weinert +2 more
openaire +3 more sources
Graphs and Combinatorics, 1985
The edge list-chromatic number, \(\chi '_{\ell}(G)\), of a graph G is the minimum among lengths \(| \Lambda (\alpha)|\) of lists \(\Lambda(\alpha)\), \(\alpha\in E(G)\), which guarantees the existence of an edge-colouring \(\phi: E(G)\to \cup_{\alpha}\Lambda(\alpha)\) with \(\phi(\alpha)\in \Lambda(\alpha)\) for each \(\alpha\in E(G)\).
Béla Bollobás, Andrew J. Harris
openaire +1 more source
The edge list-chromatic number, \(\chi '_{\ell}(G)\), of a graph G is the minimum among lengths \(| \Lambda (\alpha)|\) of lists \(\Lambda(\alpha)\), \(\alpha\in E(G)\), which guarantees the existence of an edge-colouring \(\phi: E(G)\to \cup_{\alpha}\Lambda(\alpha)\) with \(\phi(\alpha)\in \Lambda(\alpha)\) for each \(\alpha\in E(G)\).
Béla Bollobás, Andrew J. Harris
openaire +1 more source
Canadian Journal of Mathematics, 1961
A graph on n labelled nodes is a set of n objects called “nodes”, distinguishable from each other, and a set (possibly empty) of “edges,” that is, pairs of nodes. Each edge is said to join its pair of nodes, at most one edge joins any two nodes and no edge joins a node to itself.
openaire +4 more sources
A graph on n labelled nodes is a set of n objects called “nodes”, distinguishable from each other, and a set (possibly empty) of “edges,” that is, pairs of nodes. Each edge is said to join its pair of nodes, at most one edge joins any two nodes and no edge joins a node to itself.
openaire +4 more sources
Annals of Operations Research, 1984
We discuss some results concerned with the behaviour of colouring algorithms on large random graphs.
openaire +1 more source
We discuss some results concerned with the behaviour of colouring algorithms on large random graphs.
openaire +1 more source