Results 21 to 30 of about 11,451 (248)
Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms
Системный анализ и прикладная информатика, 2021 This paper is devoted to the reduction of data transfer between the main memory and direct mapped cache for blocked shortest paths algorithms (BSPA), which represent data by a D[M×M] matrix of blocks.
A. A. Prihozhy
doaj +1 more source
Equitable colorings of bounded treewidth graphs [PDF]
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bodlaender, H.L., Fomin, F.V.
openaire +4 more sources
A DSATUR-based algorithm for the Equitable Coloring Problem [PDF]
, 2015 This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit.
Méndez-Díaz, Isabel +2 more
core +2 more sources
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Archives of Control Sciences, 2016 In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. In this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent
Furmańczyk Hanna +2 more
doaj +1 more source
A polyhedral approach for the Equitable Coloring Problem [PDF]
, 2011 In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities.
Bahiense +15 more
core +2 more sources
An upper bound for the equitable chromatic number of complete n-partite graphs [PDF]
, 2014 A proper vertex coloring of a graph $G$ is equitable if the size of color classes differ by at most one. The equitable chromatic number of $G$ is the smallest integer $m$ such that $G$ is equitable m-colorable.
F. Rahbarnia, M. Moaied
core +1 more source
Equitable colorings of ��-corona products of cubic graphs [PDF]
Archives of Control SciencesA graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one.
Hanna Furmańczyk, Marek Kubale
doaj +1 more source
A Victorian Age Proof of the Four Color Theorem [PDF]
, 2010 In this paper we have investigated some old issues concerning four color map problem. We have given a general method for constructing counter-examples to Kempe's proof of the four color theorem and then show that all counterexamples can be rule out by re-
Cahit, I.
core +1 more source
On the Adjacent Strong Equitable Edge Coloring of Pn ∨ Pn, Pn ∨ Cn and Cn ∨ Cn
MATEC Web of Conferences, 2016 A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required ...
Liu Jun +4 more
doaj +1 more source
Equitable colourings of Borel graphs [PDF]
Forum of Mathematics, Pi, 2021 Abstract Hajnal and Szemerédi proved that if G is a finite graph with maximum degree $\Delta $ , then for every integer $k \geq \Delta +1$ , G has a proper colouring with k colours in which every two colour classes differ in size at most by $1$ ; such colourings ...
Anton Bernshteyn, Clinton T. Conley
openaire +3 more sources