Generating all the minimal separators of a graph

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

Volumn 1665, Issue , 1999, Pages 167-172

  Berry, Anne ^a   Bordat, Jean Paul ^a   Cogis, Olivier ^a  

^a LIRMM   (France)

Author keywords

Algorithm; Enumeration; Graph; Minimal; Separator

Indexed keywords

ALGORITHMS; GRAPH THEORY;

ENUMERATION; GRAPH; MINIMAL; TIME ALGORITHMS;

SEPARATORS;

EID: 84947813354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46784-x_17     Document Type: Conference Paper

References (15)

1. A. Berry: A Wide-Range Efficient Algorithm for Minimal Triangulation. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’99), Baltimore, Jan 1999. 167, 168
2. A. Berry: Desarticulation d’un graphe. PhD Dissertation LIRMM, 1998. 167
3. A. Berry, J.-B. Bordat: Separability Generalizes Dirac’s Theorem. Discrete Applied Mathematics 84 (1998) 43-53. 167
4. A. Berry, J.-P. Bordat: Orthotreillis et separabilite dans un graphe non-oriente. Mathematiques, Informatique et Sciences Humaines 146 (1999) 5-17. 168
5. H. Bodlaender, T. Kloks, D. Kratsch: Treewidth and Pathwidth of Permutation Graphs. SIAM Journal on Discrete Mathematics 8 (1995) 606-616. 167
6. H. Bodlaender, T. Kloks, D. Kratsch, H. Muller: Computing Treewidth and Minimum Fill-in: All You Need are the Minimal Separators. In Proceedings of the First Annual European Symposium on Algorithms (ESA’93), Vol. 726 of Lecture Notes in Computer Science, 260-271, Springer-Verlag, 1993, and erratum in Proceedings of the Second Annual European Symposium on Algorithms (ESA’94), Vol. 855 of Lecture Notes in Computer Science, 508, Springer-Verlag, 1994. 167
7. V. Bouchitte, I. Todinca: Minimal Triangulations for Graphs with "Few" Minimal Separators. In Proceedings of the Sixth Annual European Symposium on Algorithms (ESA’98), Vol. 1461 of Lecture Notes in Computer Science, 344-355, Springer-Verlag, 1998. 167, 168, 171
8. F. Escalante: Schnittverbande in Graphen. Abhandlungen aus dem Mathematis-chen Seminar des Universitat Hamburg 38 (1972) 199-220. 168
9. T. Kloks, D. Kratsch: Finding All Minimal Separators of a Graph. In Proceedings of the Eleventh Symposium on Theoretical Aspects of Computer Science (STACS’94), Vol. 775 of Lecture Notes in Computer Science, 759-768, Springer-Verlag, 1994. 167, 168, 169
10. T. Kloks, D. Kratsch: Listing All Minimal Separators of a Graph. SIAM Journal on Computing 27 (1998) 605-613. 167
11. T. Kloks, D. Kratsch, J. Spinrad: On Treewidth and Minimum Fill-in of Asteroidal Triple-free Graphs. Theoretical Computer Science 175 (1997) 309-335. 167
12. L. Nourine, O Raynaud: A Fast Algorithm for Building Lattices, Res. Rep. LIRMM 1998. 170
13. A. Parra: Structural and Algorithmic Aspects of Chordal Graph Embeddings. PhD Dissertation, Technische Universitat Berlin 1996. 167
14. H. Sheng, W. Liang: Efficient Enumeration of All Minimal Separators in a Graph. Theoretical Computer Science 180 (1997) 169-180. 167
15. I. Todinca, Aspects algorithmiques des triangulations minimales des graphes, PhD Dissertation, LIP, ENS Lyon, 1999. 167