An O(n3) algorithm for finding a minimum weighted maximal irredundant set of interval graphs with n vertices is presented. Previous article in issue

A graph G = (V, E) is an interval graph if its vertices can be put in a one to one correspondence with a family F of intervals on the real line such that ...

In contrast, X is an irredundant set if the closed neighborhood of each node in X is not contained in the union of closed neighborhoods of the other nodes in X.

An 0(n3) algorithm for finding a minimum weighted maximal irredundant set of interval graphs with n vertices is presented. 0 1998 Elsevier Science B.V..

Jun 3, 2005 · In this paper, an O(n 3) algorithm is given for finding a minimum weighted maximal irredundant set of an interval graph.

Apr 29, 1998 · Abstract. An O(n3) algorithm for finding a minimum weighted maximal irredundant set of interval graphs with n vertices is presented.

In this section, we show that the problem of finding a minimum weighted maximal irredundant set of an interval graph can also be reduced to a shortest path ...

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers. Sign up for an account to ...

This paper gives O( n log n ) and O( n 4) time algorithms for finding, respectively, a minimum weighted total dominating set and a minimum weighted maximal ...

Apr 1, 1998 · An O ( n 3 ) algorithm for finding a minimum weighted maximal irredundant set of interval graphs with n vertices is presented.