Skip to main content

2 Result(s)

within Article Remove this filter Kuo-Hui Tsai Remove this filter

and

  1. No Access

    Article

    Two Variations of the Minimum Steiner Problem

    Given a set S of starting vertices and a set T of terminating vertices in a graph G = (V,E) with non-negative weights on edges, the minimum Steiner network problem is to find a subgraph of G with the minimum tota...

    Tsan-Sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang… in Journal of Combinatorial Optimization (2005)

  2. No Access

    Article

    Fast algorithms for the dominating set problem on permutation graphs

    AnO(n log logn) (resp.O(n2 log2 n)) algorithm is presented to solve the minimum cardinality (resp. weight) dominating set problem on permutation graphs, assuming the input is a permutation. The best-known previou...

    Kuo-Hui Tsai, Wen-Lian Hsu in Algorithmica (1993)