An O(n)-time algorithm for the paired domination problem on permutation graphs
暂无分享,去创建一个
[1] Ding-Zhu Du,et al. Paired-domination of Trees , 2003, J. Glob. Optim..
[2] Kenneth J. Supowit,et al. Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs , 1985, Inf. Process. Lett..
[3] Jeremy P. Spinrad,et al. Modular decomposition and transitive orientation , 1999, Discret. Math..
[4] C. Pandu Rangan,et al. Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs , 1995, Inf. Process. Lett..
[5] Michael A. Henning,et al. Vertices contained in all or in no minimum total dominating set of a tree , 2003, Discret. Math..
[6] Michael A. Henning,et al. Paired-Domination in Claw-Free Cubic Graphs , 2004, Graphs Comb..
[7] Stavros D. Nikolopoulos. Coloring permutation graphs in parallel , 2002, Discret. Appl. Math..
[8] Dieter Kratsch,et al. On Domination Problems for Permutation and Other Graphs , 1987, Theor. Comput. Sci..
[9] T. C. Edwin Cheng,et al. Paired domination on interval and circular-arc graphs , 2007, Discret. Appl. Math..
[10] Charis Papadopoulos,et al. On the performance of the first-fit coloring algorithm on permutation graphs , 2000, Inf. Process. Lett..
[11] T. C. Edwin Cheng,et al. Paired-domination in inflated graphs , 2004, Theor. Comput. Sci..
[12] Mihalis Yannakakis,et al. Edge Dominating Sets in Graphs , 1980 .
[13] Wen-Lian Hsu,et al. Fast algorithms for the dominating set problem on permutation graphs , 2005, Algorithmica.
[14] Jeremy P. Spinrad,et al. Bipartite permutation graphs , 1987, Discret. Appl. Math..
[15] Michael A. Henning,et al. Paired-domination of Cartesian products of graphs and rainbow domination , 2005, Electron. Notes Discret. Math..
[16] Michael A. Henning,et al. Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree , 2005, J. Comb. Optim..
[17] Sylvain Gravier,et al. Paired-domination in generalized claw-free graphs , 2007, J. Comb. Optim..
[18] S. Lakshmivarahan,et al. An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph , 1996, SIAM J. Comput..
[19] Ernst W. Mayr,et al. Applications of Parallel Scheduling Algorithms to Families of Perfect Graphs , 1990 .
[20] John H. Reif,et al. Synthesis of Parallel Algorithms , 1993 .
[21] Fang-Rong Hsu,et al. An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs , 2000, Discret. Appl. Math..
[22] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .
[23] Jeremy P. Spinrad,et al. On Comparability and Permutation Graphs , 1985, SIAM J. Comput..
[24] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.
[25] Mikhail J. Atallah,et al. Finding a minimum independent dominating set in a permutation graph , 1988, Discret. Appl. Math..
[26] Chuan Yi Tang,et al. Perfect edge domination and efficient edge domination in graphs , 2002, Discret. Appl. Math..
[27] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[28] Martin Farber,et al. Domination in Permutation Graphs , 1985, J. Algorithms.
[29] T. C. Edwin Cheng,et al. A polynomial-time algorithm for the paired-domination problem on permutation graphs , 2009, Discret. Appl. Math..
[30] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[31] T. Haynes,et al. Paired‐domination in graphs , 1998 .