An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
暂无分享,去创建一个
[1] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[2] Roded Sharan,et al. A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs , 1999, SIAM J. Comput..
[3] Michel Deza,et al. Combinatorics and Computer Science , 1996, Lecture Notes in Computer Science.
[4] Christophe Paul,et al. Fully dynamic recognition algorithm and certificate for directed cographs , 2004, Graph-Theoretic Concepts in Computer Science.
[5] Peter L. Hammer,et al. Completely separable graphs , 1990, Discret. Appl. Math..
[6] Marina Moscarini,et al. Distance-Hereditary Graphs, Steiner Trees, and Connected Domination , 1988, SIAM J. Comput..
[7] Hans-Jürgen Bandelt,et al. Distance-hereditary graphs , 1986, J. Comb. Theory, Ser. B.
[8] Leonidas Palios,et al. A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs , 2006, WG.
[9] Christophe Paul,et al. Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs , 2005 .
[10] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..
[11] Wen-Lian Hsu. On-Line Recognition of Interval Graphs in O(m + nlog n) Time , 1995, Combinatorics and Computer Science.
[12] Jens Gustedt,et al. Efficient and practical modular decomposition , 1997, SODA '97.
[13] Roded Sharan,et al. A fully dynamic algorithm for modular decomposition and recognition of cographs , 2004, Discret. Appl. Math..
[14] D. West. Introduction to Graph Theory , 1995 .
[15] Stephan Olariu,et al. Recognizing P_4 Sparse Graphs in Linear Time , 1992, SIAM J. Comput..
[16] Xiaotie Deng,et al. Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs , 1996, SIAM J. Comput..
[17] Louis Ibarra,et al. Fully dynamic algorithms for chordal graphs , 1999, SODA '99.