Abstract
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n 3) time per separator, thus gaining a factor of n 2 on the current best-time algorithms for this problem. Our process is based on a newst ructural result, derived from the work of Kloks and Kratsch on listing all the minimal separators of a graph.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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
A. Berry: Dïsarticulation d’un graphe. PhD Dissertation LIRMM, 1998. 167
A. Berry, J.-B. Bordat: Separability Generalizes Dirac’s Theorem. Discrete Applied Mathematics 84 (1998) 43–53. 167
A. Berry, J.-P. Bordat: Orthotreillis et sïparabilitï dans un graphe non-orientï. Mathïmatiques, Informatique et Sciences Humaines 146 (1999) 5–17. 168
H. Bodlaender, T. Kloks, D. Kratsch: Treewidth and Pathwidth of Permutation Graphs. SIAM Journal on Discrete Mathematics 8 (1995) 606–616. 167
H. Bodlaender, T. Kloks, D. Kratsch, H. Müller: 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
V. Bouchittï, 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
F. Escalante: Schnittverbände in Graphen. Abhandlungen aus dem Mathematischen Seminar des Universität Hamburg 38 (1972) 199–220. 168
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
T. Kloks, D. Kratsch: Listing All Minimal Separators of a Graph. SIAM Journal on Computing 27 (1998) 605–613. 167
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
L. Nourine, O. Raynaud: A Fast Algorithm for Building Lattices, Res. Rep. LIRMM 1998. 170
A. Parra: Structural and Algorithmic Aspects of Chordal Graph Embeddings. PhD Dissertation, Technische Universität Berlin 1996. 167
H. Sheng, W. Liang: Efficient Enumeration of All Minimal Separators in a Graph. Theoretical Computer Science 180 (1997) 169–180. 167
I. Todinca, Aspects algorithmiques des triangulations minimales des graphes, PhD Dissertation, LIP, ENS Lyon, 1999. 167
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berry, A., Bordat, JP., Cogis, O. (1999). Generating All the Minimal Separators of a Graph. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds) Graph-Theoretic Concepts in Computer Science. WG 1999. Lecture Notes in Computer Science, vol 1665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46784-X_17
Download citation
DOI: https://doi.org/10.1007/3-540-46784-X_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66731-5
Online ISBN: 978-3-540-46784-7
eBook Packages: Springer Book Archive