{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:36:59Z","timestamp":1725482219244},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_17","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T12:02:55Z","timestamp":1175774575000},"page":"167-172","source":"Crossref","is-referenced-by-count":9,"title":["Generating All the Minimal Separators of a Graph"],"prefix":"10.1007","author":[{"given":"Anne","family":"Berry","sequence":"first","affiliation":[]},{"given":"Jean-Paul","family":"Bordat","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Cogis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"A. Berry: A Wide-Range Efficient Algorithm for Minimal Triangulation. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201999), Baltimore, Jan. 1999. 167, 168"},{"key":"17_CR2","unstructured":"A. Berry: D\u00efsarticulation d\u2019un graphe. PhD Dissertation LIRMM, 1998. 167"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(98)00005-5","volume":"84","author":"A. Berry","year":"1998","unstructured":"A. Berry, J.-B. Bordat: Separability Generalizes Dirac\u2019s Theorem. Discrete Applied Mathematics 84 (1998) 43\u201353. 167","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR4","first-page":"5","volume":"146","author":"A. Berry","year":"1999","unstructured":"A. Berry, J.-P. Bordat: Orthotreillis et s\u00efparabilit\u00ef dans un graphe non-orient\u00ef. Math\u00efmatiques, Informatique et Sciences Humaines 146 (1999) 5\u201317. 168","journal-title":"Math\u00efmatiques, Informatique et Sciences Humaines"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/S089548019223992X","volume":"8","author":"H. Bodlaender","year":"1995","unstructured":"H. Bodlaender, T. Kloks, D. Kratsch: Treewidth and Pathwidth of Permutation Graphs. SIAM Journal on Discrete Mathematics 8 (1995) 606\u2013616. 167","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, T. Kloks, D. Kratsch, H. M\u00fcller: Computing Treewidth and Minimum Fill-in: All You Need are the Minimal Separators. In Proceedings of the First Annual European Symposium on Algorithms (ESA\u201993), Vol. 726 of Lecture Notes in Computer Science, 260\u2013271, Springer-Verlag, 1993, and erratum in Proceedings of the Second Annual European Symposium on Algorithms (ESA\u201994), Vol. 855 of Lecture Notes in Computer Science, 508, Springer-Verlag, 1994. 167","DOI":"10.1007\/3-540-57273-2_61"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"V. Bouchitt\u00ef, I. Todinca: Minimal Triangulations for Graphs with \u201cFew\u201d Minimal Separators. In Proceedings of the Sixth Annual European Symposium on Algorithms (ESA\u201998), Vol. 1461 of Lecture Notes in Computer Science, 344\u2013355, Springer-Verlag, 1998. 167, 168, 171","DOI":"10.1007\/3-540-68530-8_29"},{"key":"17_CR8","first-page":"199","volume":"38","author":"F. Escalante","year":"1972","unstructured":"F. Escalante: Schnittverb\u00e4nde in Graphen. Abhandlungen aus dem Mathematischen Seminar des Universit\u00e4t Hamburg 38 (1972) 199\u2013220. 168","journal-title":"Schnittverb\u00e4nde in Graphen"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"T. Kloks, D. Kratsch: Finding All Minimal Separators of a Graph. In Proceedings of the Eleventh Symposium on Theoretical Aspects of Computer Science (STACS\u201994), Vol. 775 of Lecture Notes in Computer Science, 759\u2013768, Springer-Verlag, 1994. 167, 168, 169","DOI":"10.1007\/3-540-57785-8_188"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S009753979427087X","volume":"27","author":"T. Kloks","year":"1998","unstructured":"T. Kloks, D. Kratsch: Listing All Minimal Separators of a Graph. SIAM Journal on Computing 27 (1998) 605\u2013613. 167","journal-title":"SIAM Journal on Computing"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0304-3975(96)00206-X","volume":"175","author":"T. Kloks","year":"1997","unstructured":"T. Kloks, D. Kratsch, J. Spinrad: On Treewidth and Minimum Fill-in of Asteroidal Triple-free Graphs. Theoretical Computer Science 175 (1997) 309\u2013335. 167","journal-title":"Theoretical Computer Science"},{"key":"17_CR12","unstructured":"L. Nourine, O. Raynaud: A Fast Algorithm for Building Lattices, Res. Rep. LIRMM 1998. 170"},{"key":"17_CR13","unstructured":"A. Parra: Structural and Algorithmic Aspects of Chordal Graph Embeddings. PhD Dissertation, Technische Universit\u00e4t Berlin 1996. 167"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0304-3975(97)83809-1","volume":"180","author":"H. Sheng","year":"1997","unstructured":"H. Sheng, W. Liang: Efficient Enumeration of All Minimal Separators in a Graph. Theoretical Computer Science 180 (1997) 169\u2013180. 167","journal-title":"Theoretical Computer Science"},{"key":"17_CR15","unstructured":"I. Todinca, Aspects algorithmiques des triangulations minimales des graphes, PhD Dissertation, LIP, ENS Lyon, 1999. 167"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T03:38:20Z","timestamp":1556336300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}