Results 1  10
of
624,602
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
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
Online ConflictFree Coloring for Intervals
, 2004
"... 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 10 (2 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 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
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
Conflictfree colorings of shallow discs
 In Proc. 22nd Annual ACM Symposium on Computational Geometry (SoCG
, 2006
"... We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log 3 k) colors so that for each point p in the union of all discs there is at least one disc in the collection containing p whose color differs from that of all other members of the ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log 3 k) colors so that for each point p in the union of all discs there is at least one disc in the collection containing p whose color differs from that of all other members
ConflictFree Coloring of Points with Respect to Rectangles and Approximation Algorithms for Discrete Independent Set
, 2012
"... In the conflictfree coloring problem, for a given range space, we want to bound the minimum value F (n) such that every set P of n points can be colored with F (n) colors with the property that every nonempty range contains a unique color. We prove a new upper bound O(n0.368) with respect to orthog ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In the conflictfree coloring problem, for a given range space, we want to bound the minimum value F (n) such that every set P of n points can be colored with F (n) colors with the property that every nonempty range contains a unique color. We prove a new upper bound O(n0.368) with respect
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
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
. The algorithms are tested on a standard LennardJones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers  the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray YMP and C90 algorithm shows
Results 1  10
of
624,602