Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation
暂无分享,去创建一个
[1] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[2] Jens Gustedt,et al. Efficient and Practical Algorithms for Sequential Modular Decomposition , 2001, J. Algorithms.
[3] Jens Gustedt,et al. Partially Complemented Representations of Digraphs , 2002, Discret. Math. Theor. Comput. Sci..
[4] Celina M. H. de Figueiredo,et al. Even and Odd Pairs in Comparability and in P4-comparability Graphs , 1999, Discret. Appl. Math..
[5] Klaus Simon,et al. On the P4-components of graphs , 2000, Discret. Appl. Math..
[6] Srinivasa Rao Arikati,et al. A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs , 1996, Discret. Appl. Math..
[7] V. Chvátal. Perfectly Ordered Graphs , 1984 .
[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[9] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.
[10] Mitsuo Yokoyama,et al. Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs , 1998, Inf. Process. Lett..
[11] Dominique de Werra,et al. Four classes of perfectly orderable graphs , 1987, J. Graph Theory.
[12] Leonidas Palios,et al. Recognition and Orientation Algorithms for P4-Comparability Graphs , 2001, ISAAC.
[13] Bruce A. Reed,et al. P4-comparability graphs , 1989, Discret. Math..
[14] Jeremy P. Spinrad,et al. Linear-time transitive orientation , 1997, SODA '97.
[15] Bruce A. Reed,et al. Some classes of perfectly orderable graphs , 1989, J. Graph Theory.
[16] Matthias MIDDENDORF,et al. On the complexity of recognizing perfectly orderable graphs , 1990, Discret. Math..
[17] Jorge Urrutia,et al. Comparability graphs and intersection graphs , 1983, Discret. Math..
[18] Chính T. Hoàng,et al. Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs , 1994, Discret. Appl. Math..
[19] Laurent Viennot,et al. Linear time recognition of P4-indifference graphs , 2001, Discret. Math. Theor. Comput. Sci..
[20] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .