A vertex incremental approach for dynamically maintaining chordal graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 47-57

  Berry, Anne ^a   Heggernes, Pinar ^b   Villanger, Yngve ^b  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SURVEYING; TRIANGULATION;

ARBITRARY INPUTS; CHORDAL GRAPHS; INCREMENTAL APPROACH; MINIMAL TRIANGULATIONS; SUBGRAPHS; TIME BOUND; TIME COMPLEXITY;

GRAPH THEORY;

EID: 35248848869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_7     Document Type: Article

References (22)

1. S. Arikati and P. Rangan. An efficient algorithm for finding a two-pair, and its applications. Disc. Appl. Math. Comb. Oper. Res., 31:71-74, 1991.
2. E. Balas. A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. Disc. Appl. Math., 15:123-134, 1986.
3. A. Berry. A wide-range efficient algorithm for minimal triangulation. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.
4. A. Berry, J. Blair, and P. Heggernes. Maximum cardinality search for computing minimal triangulations. In L. Kucera, editor, Graph Theoretical Concepts in Computer Science - WG 2002, LNCS 2573, pages 1-12. Springer Verlag, 2002.
5. A. Berry, J-P. Bordat, P. Heggernes, G. Simonet, and Y. Villanger. A wide-range algorithm for minimal triangulation from an arbitrary ordering. Technical Report Reports in Informatics 243, University of Bergen, Norway, 2003.
6. A. Berry, A. Sigayret, and C. Sinoquet. Maximal sub-triangulation as improving phylogenetic data. Technical Report RR-02-02, LIMOS, Clermont-Ferrand, France, 2002.
7. J. R. S. Blair, P. Heggernes, and J. A. Telle. A practical algorithm for making filled graphs minimal. Theoretical Computer Science, 250:125-141, 2001.
8. J. R. S. Blair and B. W. Peyton. An introduction to chordal graphs and clique trees. In J. A. George, J. R. Gilbert, and J. W. H. Liu, editors, Graph Theory and Sparse Matrix Computations, pages 1-30. Springer Verlag, 1993. IMA Volumes in Mathematics and its Applications, Vol. 56.
9. P. Buneman. A characterization of rigid circuit graphs. Discrete Math., 9:205-212, 1974.
10. E. Dahlhaus. Minimal elimination ordering inside a given chordal graph. In R. H. Möhring, editor, Graph Theoretical Concepts in Computer Science - WG '97, LNCS 1335, pages 132-143. Springer Verlag, 1997.
11. P. M. Dearing, D. R. Shier, and D. D. Warner. Maximal chordal subgraphs. Disc. Appl. Math., 20:181-190, 1988.
12. G. A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76, 1961.
13. F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory Ser. B, 16:47-56, 1974.
14. R. Hayward, C. Hoàng, and F. Maffray. Optimizing weakly triangulated graphs. Graphs and Combinatorics, 5:339-349, 1989.
15. C-W. Ho and R. C. T. Lee. Counting clique trees and computing perfect elimination schemes in parallel. Inform. Process. Lett., 31:61-68, 1989.
16. L. Ibarra. Fully dynamic algorithms for chordal graphs. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.
17. A. Natanzon, R. Shamir, and R. Sharan. Complexity classification of some edge modification problems. Disc. Appl. Math., 113:109-128, 2001.
18. D. J. Rose, R. E. Tarjan, and G. S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. Compul., 5:266-283, 1976.
19. J. Spinrad and R. Sritharan. Algorithms for weakly triangulated graphs. Disc. Appl. Math., 59:181-191, 1995.
20. J. Walter. Representations of rigid cycle graphs. PhD thesis, Wayne State University, USA, 1972.
21. J. Xue. Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. Networks, 24:109-120, 1994.
22. M. Yannakakis. Computing the minimum fill-in is NP-complete. SIAM J. Alg. Disc. Meth., 2:77-79, 1981.