Results 1  10
of
34,147
Graph uniquemaximum and conflictfree colorings
 In Proc. 7th International Conference on Algorithms and Complexity (CIAC
, 2010
"... We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflictfree colorings. In a uniquemaximum coloring, the colors are ordered, and in every path of the graph the maximum color appears only once. In a conflictfree coloring, in every path ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflictfree colorings. In a uniquemaximum coloring, the colors are ordered, and in every path of the graph the maximum color appears only once. In a conflictfree coloring, in every path
Uniquemaximum and conflictfree colorings for hypergraphs and tree graphs, arXiv:1002.4210v1
, 2010
"... We investigate the relationship between two kinds of vertex colorings of hypergraphs: uniquemaximum colorings and conflictfree colorings. In a uniquemaximum coloring, the colors are ordered, and in every hyperedge of the hypergraph the maximum color appears only once. In a conflictfree coloring, ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We investigate the relationship between two kinds of vertex colorings of hypergraphs: uniquemaximum colorings and conflictfree colorings. In a uniquemaximum coloring, the colors are ordered, and in every hyperedge of the hypergraph the maximum color appears only once. In a conflictfree coloring
Conflictfree coloring of graphs
, 2013
"... We study the conflictfree chromatic number χCF of graphs from extremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflictfree chromatic number an nvertex graph can have. Our construction is randomized. In relation to this we study the evolution o ..."
Abstract
 Add to MetaCart
We study the conflictfree chromatic number χCF of graphs from extremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflictfree chromatic number an nvertex graph can have. Our construction is randomized. In relation to this we study the evolution
Conflictfree colorings of graphs and hypergraphs
"... A coloring of the vertices of a hypergraph H is called conflictfree if each hyperedge E of H contains a vertex of “unique ” color that does not get repeated in E. The smallest number of colors required for such a coloring is called the conflictfree chromatic number of H, and is denoted by χCF(H). ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
A coloring of the vertices of a hypergraph H is called conflictfree if each hyperedge E of H contains a vertex of “unique ” color that does not get repeated in E. The smallest number of colors required for such a coloring is called the conflictfree chromatic number of H, and is denoted by χ
On ConflictFree MultiColoring?
"... Abstract A conflictfree coloring of a hypergraph H = (V, E), E ⊆ 2V, is a coloring of the vertices V such that every hyperedge E ∈ E contains a vertex of “unique ” color. Our goal is to minimize the total number of distinct colors. In its full generality, this problem is known as the conflictfree ..."
Abstract
 Add to MetaCart
Abstract A conflictfree coloring of a hypergraph H = (V, E), E ⊆ 2V, is a coloring of the vertices V such that every hyperedge E ∈ E contains a vertex of “unique ” color. Our goal is to minimize the total number of distinct colors. In its full generality, this problem is known as the conflictfree
Kinetic ConflictFree Coloring∗
"... A conflictfree coloring, or CFcoloring for short, of a set P of points in the plane with respect to disks is a coloring of the points of P with the following property: for any disk D containing at least one point of P there is a point p ∈ P ∩D so that no other point q ∈ P ∩D has the same color as ..."
Abstract
 Add to MetaCart
A conflictfree coloring, or CFcoloring for short, of a set P of points in the plane with respect to disks is a coloring of the points of P with the following property: for any disk D containing at least one point of P there is a point p ∈ P ∩D so that no other point q ∈ P ∩D has the same color
Online ConflictFree Coloring for Intervals
, 2006
"... We consider an online version of the conflictfree coloring of a set of points on the line, where each newly inserted point must be assigned a color upon insertion, and at all times the coloring has to be conflictfree, in the sense that in every interval I there is a color that appears exactly once ..."
Abstract

Cited by 26 (6 self)
 Add to MetaCart
We consider an online version of the conflictfree coloring of a set of points on the line, where each newly inserted point must be assigned a color upon insertion, and at all times the coloring has to be conflictfree, in the sense that in every interval I there is a color that appears exactly
ConflictFree Colorings of Rectangles Ranges
 In Proc. 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006
, 2006
"... Abstract. Given the range space (P, R), where P is a set of n points in IR 2 and R is the family of subsets of P induced by all axisparallel rectangles, the conflictfree coloring problem asks for a coloring of P with the minimum number of colors such that (P, R) is conflictfree. We study the foll ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Abstract. Given the range space (P, R), where P is a set of n points in IR 2 and R is the family of subsets of P induced by all axisparallel rectangles, the conflictfree coloring problem asks for a coloring of P with the minimum number of colors such that (P, R) is conflictfree. We study
ConflictFree Coloring and its Applications
, 2010
"... Let H = (V, E) be a hypergraph. A conflictfree coloring of H is an assignment of colors to V such that in each hyperedge e ∈ E there is at least one uniquelycolored vertex. This notion is an extension of the classical graph coloring. Such colorings arise in the context of frequency assignment to c ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Let H = (V, E) be a hypergraph. A conflictfree coloring of H is an assignment of colors to V such that in each hyperedge e ∈ E there is at least one uniquelycolored vertex. This notion is an extension of the classical graph coloring. Such colorings arise in the context of frequency assignment
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Results 1  10
of
34,147