244 search results - page 6 / 49 » Intervalizing k-Colored Graphs |
MMMACNS
2005
Springer
15 years 2 months ago
2005
Springer
A new model for representing temporal access control policies is introduced. In this model, temporal authorizations are represented by time attributes associated with both subjects...
83
Voted
ALGORITHMICA
2010
14 years 9 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...