The development of commercial real-time location system (RTLS) enables new ICT solutions. This paper presents an intelligent surveillance system for indoor high-security environments based on RTLS and artificial intelligence methods. The system consists of several software modules each specialized for detection of specific security risks. The validation shows that the system is capable of detec...

A polychromatic k-coloring of a plane graph G is an assignment of k colors to the vertices of G such that every face of G has all k colors on its boundary. For a given plane graph G, we seek the maximum number k such that G admits a polychromatic k-coloring. We call a k-coloring in the classical sense (i.e., no monochromatic edges) that is also a polychromatic k-coloring a strong polychromatic ...

A hypergraph is a set V of vertices and a set E of non-empty subsets of V , called hyperedges. Unlike graphs, hypergraphs can perform higher-order interactions in social and communication networks. Directed hypergraphs are much like directed graphs. Colors are used to distinguish the classes. Coloring a hypergraph H must assign atleast two different colors to the vertices of every hyperedge. Th...

A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G having no parity path (a parity edge-coloring). Let p̂(G) be the least number of colors in an edge-coloring of G having no open parity walk (a strong parity edge-coloring). Always p̂(G) ≥ p(G) ≥ χ′(G). We prove that p̂(Kn) = ...

Acyclic-coloring of a graph G = (V; E) is a partitioning of V , such that the induced subgraph of each partition is acyclic. The minimum number of such partitions of V is deened as the vertex arboricity of G. An O(n) algorithm (n = jV j) for acyclic-coloring of planar graphs with 3 colors is presented. Next, an O(n 2) heuristic is proposed which produces a valid acyclic-2-coloring of a planar g...

The pre-coloring extension problem consists, given a graph G and a subset of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs....

Acyclic-coloring of a graph G = (V;E) is a partitioning of V , such that the induced subgraph of each partition is acyclic. The minimumnumber of such partitions of V is de ned as the vertex arboricity of G. An O(n) algorithm (n = jV j) for acyclic-coloring of planar graphs with 3 colors is presented. Next, an O(n) heuristic is proposed which produces a valid acyclic-2-coloring of a planar graph...

The pre-coloring extension problem consists, given a graph G and a subset of nodes to which some colors are already assigned, in nding a coloring of G with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs. W...

In this paper we propose a deterministic parallel graph coloring algorithm that enables Multi-Coloring in parallel for sparse undirected graphs by coarse-grained segmentation and symmetry breaking. The proposed algorithm is implemented and tested on standard problem instances from engineering applications and benchmarked against various deterministic graph coloring algorithms. Quantified result...

We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without bandwidth and a new problem called lazy online coloring again with and without bandwidth. We consider both general interval graphs and unit interval graphs. Specifically, we establish the difference between the two mai...