Fully dynamic algorithms for chordal graphs and split graphs
暂无分享,去创建一个
[1] David Eppstein,et al. Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.
[2] Stavros D. Nikolopoulos. Constant-Time Parallel Recognition of Split Graphs , 1995, Inf. Process. Lett..
[3] M. Golumbic. Chapter 3 - Perfect graphs , 2004 .
[4] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[5] Russell Merris,et al. Split graphs , 2003, Eur. J. Comb..
[6] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[7] Monika Henzinger,et al. Randomized dynamic graph algorithms with polylogarithmic time per operation , 1995, STOC '95.
[8] Michael E. Lundquist. Zero Patterns, Chordal Graphs and Matrix Completions , 1990 .
[9] Peter L. Hammer,et al. The splittance of a graph , 1981, Comb..
[10] David Eppstein,et al. Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[11] Roded Sharan,et al. A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs , 1999, SIAM J. Comput..
[12] Daniel M. Yellin. An Algorithm for Dynamic Subset and Intersection Testing , 1994, Theor. Comput. Sci..
[13] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..
[14] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..
[15] Robert E. Tarjan,et al. Algorithmic aspects of vertex elimination , 1975, STOC.
[16] James R. Walter,et al. Representations of chordal graphs as subtrees of a tree , 1978, J. Graph Theory.
[17] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[18] David Eppstein,et al. Dynamic graph algorithms , 2010 .
[19] Pinar Heggernes,et al. A practical algorithm for making filled graphs minimal , 2001, Theor. Comput. Sci..
[20] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .
[21] Philip N. Klein. Efficient Parallel Algorithms for Chordal Graphs , 1996, SIAM J. Comput..
[22] Philip A. Bernstein,et al. Power of Natural Semijoins , 1981, SIAM J. Comput..
[23] J. G. Lewis,et al. A fast algorithm for reordering sparse matrices for parallel factorization , 1989 .
[24] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[25] Richard C. T. Lee,et al. Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel , 1989, Inf. Process. Lett..
[26] Greg N. Frederickson,et al. Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..
[27] F. McMorris,et al. Topics in Intersection Graph Theory , 1987 .
[28] B. Peyton,et al. An Introduction to Chordal Graphs and Clique Trees , 1993 .
[29] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .
[30] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..
[31] Charles R. Johnson,et al. Positive definite completions of partial Hermitian matrices , 1984 .