Let G = (V,E) be an undirected graph and let π = {V1, V2, . . . , Vk} be a partition of the vertices V of G into k blocks Vi. From this partition one can construct the following digraph D(π) = (π,E(π)), the vertices of which correspond one-to-one with the k blocks Vi of π, and there is an arc from Vi to Vj if every vertex in Vj is adjacent to at least one vertex in Vi, that is, Vi dominates Vj ...

Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet according to the highest priority matching rule. Within the packet classification hash-based algorithms, an algorithm that is gaining interest is the tuple space search algorithm that groups the rules into a set of tuple space...

Routers must perform packet classi cation at high speeds to e ciently implement functions such as rewalls and QoS routing. Packet classi cation requires matching each packet against a database of lters (or rules), and forwarding the packet according to the highest priority lter. Existing lter schemes with fast lookup time do not scale to large lter databases. Other more scalable schemes work fo...

We consider four different types of multiple domination and provide new improved upper bounds for the kand k-tuple domination numbers. They generalise two classical bounds for the domination number and are better than a number of known upper bounds for these two multiple domination parameters. Also, we explicitly present and systematize randomized algorithms for finding multiple dominating sets...

The time complexity of algorithms establishing arc consistency for table constraints depends mainly on the number of involved tuples. Thus, several work have been carried out in order to decrease that number. Notably, Katsirelos and Walsh have proposed to compress the tuple set. They integrate their method into GAC-Schema and they showed how a set of f forbidden tuples may be represented by a s...

21 tuple tuple tuple tuple tuple tuple tuple RELDB Publications Authors PubAuthors bibs bib title link journal month <!DOCTYPE BIBS [

The k-tuple domination problem, for a fixed positive integer k, is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The case when k 2 is called 2-tuple domination problem or double domination problem. In this paper, the 2-tuple domination problem is studied on interval graphs from an algorithmic point of view, which takes ...