This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup alg...
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...