Fully dynamic algorithms for chordal graphs and split graphs

ACM Transactions on Algorithms

Volumn 4, Issue 4, 2008, Pages

  Ibarra, Louis ^a  

^a DEPAUL UNIVERSITY   (United States)

Author keywords

Chordal graphs; Clique trees; Dynamic graph algorithms; Split graphs

Indexed keywords

CHORDAL GRAPHS; CLIQUE TREES; DYNAMIC GRAPH ALGORITHMS; SPLIT GRAPHS;

TREES (MATHEMATICS);

EID: 50849091588     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1383369.1383371     Document Type: Article

References (29)

1. BERNSTEIN, P. A., AND GOODMAN, N. 1981. Power of natural semijoins. SIAM J. Comput. 10, 751-771.
2. BLAIR, J. R. S., HEGGERNES, P., AND TELLE, J. A. 2001. A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. 250, 1-2, 125-141.
3. BLAIR, J. R. S., AND PEYTON, B. 1993. An introduction to chordal graphs and clique trees. In Graph Theory and Sparse Matrix Computation. IMA Volumes in Mathematics and its Applications, vol. 56. Springer, New York, 1-29.
4. BUNEMAN, P. 1974. A characterization of rigid circuit graphs. Discr. Math. 9, 205-212.
5. EPPSTEIN, D., GALIL, Z., AND ITALIANO, G. F. 1998. Dynamic graph algorithms. In Algorithms and Theory of Computation Handbook, M. J. Atallah, ed. CRC Press, Boca Raton, FL, Chapter 8.
6. EPPSTEIN, D., GAUL, Z., ITALIANO, G. F., AND NISSENZWEIG, A. 1997. Sparsification - A technique for speeding up dynamic graph algorithms. J. ACM 44, 5, 669-696.
7. FEIGENBAUM, J., AND KANNAN, S. 1999. Dynamic graph algorithms. In Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen, ed. CRC Press, Boca Raton, FL, Chapter 17.
8. FÖLDES, S., AND HAMMER, P. L. 1977. Split graphs. Congr. Numer. 19, 311-315.
9. FREDERICKSON, G. N. 1985. Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14, 4, 781-798.
10. FULKERSON, D., AND GROSS, O. 1965. Incidence matrices and interval graphs. Pacific J. Math. 15, 3, 835-855.
11. GAVRIL, F. 1972. Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1, 2, 180-187.
12. GAVRIL, F. 1974. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combinatorial Theory B 16, 47-56.
13. GOLUMBIC, M. C. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
14. GRONE, R., JOHNSON, C. R., SA, E. M., AND WOLKOWICZ, H. 1984. Positive definite completions of partial Hermitian matrices. Linear Algeb. Appl. 58, 109-124.
15. HAMMER, P. L., AND SIMEONE, B. 1981. The splittance of a graph. Combinatorica 1, 275-284.
16. HEGGERNES, P. 1999. Personal communication, May.
17. HELL, P., SHAMIR, R., AND SHARAN, R. 2001. A fully dynamic algorithm for recognizing and representing proper interval graphs. SIAM J. Comput. 31, 289-305.
18. HENZINGER, M. R., AND KING, V. 1999. Randomized dynamic graph algorithms with polylogatithmic time per operation. J. ACM 46, 4, 502-516.
19. HO, C., AND LEE, R. C. T. 1989. Counting clique trees and computing perfect elimination schemes in parallel. Inf. Process. Lett. 31, 61-68.
20. KLEIN, P. 1996. Efficient parallel algorithms for chordal graphs. SIAM J. Comput. 25, 4, 797-827.
21. LEWIS, J. G., PEYTON, B. W., AND POTHEN, A. 1989. A fast algorithm for reordering sparse matrices for parallel factorization. SIAM J. Comput. 10, 6, 1146-1173.
22. LUNDQUIST, M. 1990. Zero patterns, chordal graphs, and matrix completions. Ph.D. thesis, Department of Mathematical Sciences, Clemson University.
23. MCKEE, T. A., AND MCMORRIS, F. R. 1999. Topics in Intersection Graph Theory. Society for Industrial and Applied Mathematics, Philadelphia, PA. Monograph.
24. NIKOLOPOULOS, S. D. 1995. Constant-Time parallel recognition of split graphs. Inf. Process. Lett. 54, 1-8.
25. ROSE, D. J., TARJAN, R. E., AND LUEKER, G. S. 1976. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 2, 266-283.
26. SLEATOR, D. D., AND TARJAN, R. E. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 362-391.
27. TARJAN, R. E., AND YANNAKAKIS, M. 1984. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13, 3, 566-579.
28. WALTER, J. R. 1978. Representations of chordal graphs as subtrees of a tree J. Graph Theory 2, 265-267.
29. YELLIN, D. 1994. An algorithm for dynamic subset and intersection testing. Theor Comput. Sci. 129, 397-406.