Adding an Edge in a Cograph
暂无分享,去创建一个
[1] Jeremy P. Spinrad,et al. Efficient graph representations , 2003, Fields Institute monographs.
[2] H. A. Jung,et al. On a class of posets and the corresponding comparability graphs , 1978, J. Comb. Theory B.
[3] Michel Habib,et al. A Simple Linear Time LexBFS Cograph Recognition Algorithm , 2003, WG.
[4] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[5] Leonidas Palios,et al. An Optimal Parallel Co-Connectivity Algorithm , 2004, Theory of Computing Systems.
[6] Roded Sharan,et al. A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs , 1999, SIAM J. Comput..
[7] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[8] Derek G. Corneil,et al. Complement reducible graphs , 1981, Discret. Appl. Math..
[9] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..
[10] Jens Gustedt,et al. Partially Complemented Representations of Digraphs , 2002, Discret. Math. Theor. Comput. Sci..
[11] Roded Sharan,et al. A fully dynamic algorithm for modular decomposition and recognition of cographs , 2004, Discret. Appl. Math..
[12] Louis Ibarra,et al. Fully dynamic algorithms for chordal graphs , 1999, SODA '99.
[13] S. Olariu,et al. An optimal path cover algorithm for cographs , 1995 .