Finding a minimum independent dominating set in a permutation graph
暂无分享,去创建一个
Abstract We give a linear time reduction of the problem of finding a minimum independent dominating set in a permutation graph, into that of finding a shortest maximal increasing subsequence. We then give an O( n log 2 n )-time algorithm for solving the second (and hence the first) problem. This improves on the O ( n 3 )-time algorithm given in [4] for solving the problem of finding a minimum independent dominating set in a permutation graph.
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Martin Farber,et al. Domination in Permutation Graphs , 1985, J. Algorithms.
[3] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..