A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs-Reference-Cited by-同舟云学术

A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs

Published:2003 Issue: Volume: Page:47-57
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Berry Anne,Heggernes Pinar,Villanger Yngve

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24587-2_7

Reference22 articles.

1. Arikati, S., Rangan, P.: An efficient algorithm for finding a two-pair, and its applications. Disc. Appl. Math. Comb. Oper. Res. 31, 71–74 (1991)

2. Balas, E.: A fast algorithm for finding an edge-maximal subgraph with a TRformative coloring. Disc. Appl. Math. 15, 123–134 (1986)

3. Berry, A.: A wide-range efficient algorithm for minimal triangulation. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (1999)

4. Lecture Notes in Computer Science;A. Berry,2002

5. Berry, A., Bordat, J.-P., Heggernes, P., Simonet, G., Villanger, Y.: A wide-range algorithm for minimal triangulation from an arbitrary ordering. Technical Report Reports in Informatics 243, University of Bergen, Norway (2003)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Iterative proportional scaling via decomposable submodels for contingency tables;Computational Statistics & Data Analysis;2009-02

2. Two methods for the generation of chordal graphs;Annals of Operations Research;2007-07-06

3. Lex M versus MCS-M;Discrete Mathematics;2006-02

4. Minimal triangulations of graphs: A survey;Discrete Mathematics;2006-02

5. Minimal Interval Completions;Algorithms – ESA 2005;2005