Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs
暂无分享,去创建一个
[1] Jeremy P. Spinrad. Finding Large Holes , 1991, Inf. Process. Lett..
[2] Jeremy P. Spinrad,et al. Algorithms for Weakly Triangulated Graphs , 1995, Discret. Appl. Math..
[3] C. Pandu Rangan,et al. An efficient algorithm for finding a two-pair, and its applications , 1991, Discret. Appl. Math..
[4] Catriel Beeri,et al. On the Desirability of Acyclic Database Schemes , 1983, JACM.
[5] Stephan Olariu,et al. A charming class of perfectly orderable graphs , 1992, Discret. Math..
[6] Ryan B. Hayward,et al. Weakly triangulated graphs , 1985, J. Comb. Theory, Ser. B.
[7] Xin He,et al. Parallel Algorithm for Cograph Recognition with Applications , 1992, J. Algorithms.
[8] D. Rose. Triangulated graphs and the elimination process , 1970 .
[9] Chính T. Hoàng,et al. on the Complexity of Recognizing a Class of Perfectly orderable Graphs , 1996, Discret. Appl. Math..
[10] Elias Dahlhaus,et al. Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs , 1995, Discret. Appl. Math..
[11] Laks V. S. Lakshmanan,et al. Efficient Parallel Algorithms for Finding Chordless Cycles in Graphs , 1993, Parallel Process. Lett..
[12] Ryan B. Hayward. Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability , 1997, Discret. Appl. Math..