We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
We present two algorithms for learning large-scale gene regulatory networks from microarray data: a modified informationtheory-based Bayesian network algorithm and a modified asso...
Zan Huang, Jiexun Li, Hua Su, George S. Watts, Hsi...
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...