Dynamic Distance Hereditary Graphs Using Split Decomposition
暂无分享,去创建一个
[1] Peter L. Hammer,et al. Completely separable graphs , 1990, Discret. Appl. Math..
[2] T. Gallai. Transitiv orientierbare Graphen , 1967 .
[3] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..
[4] W. Cunningham. Decomposition of Directed Graphs , 1982 .
[5] Derek G. Corneil,et al. An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs , 2007, STACS.
[6] Martin Mathieu,et al. List of Open Problems , 1998 .
[7] David Eppstein,et al. Delta-Confluent Drawings , 2005, Graph Drawing.
[8] Hans-Jürgen Bandelt,et al. Distance-hereditary graphs , 1986, J. Comb. Theory, Ser. B.
[9] F. McMorris,et al. Topics in Intersection Graph Theory , 1987 .
[10] Tsan-sheng Hsu,et al. Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs , 2002, COCOON.
[11] Louis Ibarra,et al. Fully dynamic algorithms for chordal graphs , 1999, SODA '99.
[12] Christophe Paul,et al. Fully dynamic recognition algorithm and certificate for directed cographs , 2006, Discret. Appl. Math..
[13] Christopher Charnes,et al. Algorithms and Theory of Computation Handbook , 2009 .
[14] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .
[15] Roded Sharan,et al. A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs , 1999, SIAM J. Comput..
[16] B. Reed,et al. Polynomial Time Recognition of Clique-Width ≤ 3 Graphs , 2000 .
[17] Sang-il Oum,et al. Rank-width and vertex-minors , 2005, J. Comb. Theory, Ser. B.
[18] Anna Bretscher. Lexbfs based recognition algorithms for cographs and related families , 2005 .
[19] Udi Rotics,et al. Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract) , 2000, Latin American Symposium on Theoretical Informatics.
[20] Christophe Paul,et al. Fully dynamic recognition algorithm and certificate for directed cographs , 2004, Graph-Theoretic Concepts in Computer Science.
[21] Elias Dahlhaus,et al. Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition , 2000, J. Algorithms.
[22] Elias Dahlhaus. Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract) , 1994, FSTTCS.
[23] Roberto Tamassia,et al. On-Line Planarity Testing , 1989, SIAM J. Comput..
[24] Christophe Paul,et al. Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs , 2008, Algorithmica.
[25] TamassiaRoberto,et al. On-Line Planarity Testing , 1996 .
[26] Michel Habib,et al. A simple paradigm for graph recognition: application to cographs and distance hereditary graphs , 2001, Theor. Comput. Sci..
[27] Gaston H. Gonnet,et al. LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings , 2000, Lecture Notes in Computer Science.
[28] Roded Sharan,et al. A fully dynamic algorithm for modular decomposition and recognition of cographs , 2004, Discret. Appl. Math..
[29] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .