{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:20Z","timestamp":1759638980936,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"},{"type":"electronic","value":"9783540446798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_34","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T17:00:37Z","timestamp":1265734837000},"page":"308-317","source":"Crossref","is-referenced-by-count":9,"title":["A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph"],"prefix":"10.1007","author":[{"given":"L. Sunil","family":"Chandran","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1109\/TCT.1972.1083456","volume":"CT-19","author":"H. Ariyoshi","year":"1972","unstructured":"H. Ariyoshi, Cut-set graph and systematic generation of separating sets. IEEE Transactions on circuit theory, CT-19 (1972) 233\u2013240.","journal-title":"IEEE Transactions on circuit theory"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G.A. Dirac","year":"1961","unstructured":"G.A. Dirac, On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71\u201376, 1961.","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"issue":"4","key":"34_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S. Even","year":"1975","unstructured":"S. Even, R.E. Tarjan, Network Flow And Testing Graph Connectivity SIAM J. Comp. 4(4) 507\u2013518, December 1975.","journal-title":"SIAM J. Comp"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, Using Expander Graphs to Find Vertex Connectivity. Annual Symposium on Foundations of Computer Science, 2000.","DOI":"10.1109\/SFCS.2000.892129"},{"key":"34_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511569913","volume-title":"Efficient Algorithms For Listing Combinatorial Structures","author":"L.A. Goldberg","year":"1993","unstructured":"L.A. Goldberg, Efficient Algorithms For Listing Combinatorial Structures. Cambridge University Press, Cambridge, 1993."},{"key":"34_CR6","volume-title":"Algorithmic Graph Theory And Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory And Perfect Graphs. Academic Press, New York, 1980."},{"key":"34_CR7","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary, Graph Theory. Addison-Wesley Reading, MA, 1969."},{"issue":"1-2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0304-3975(97)83809-1","volume":"180","author":"H. Shen","year":"1997","unstructured":"Hong Shen and Weifa Liang, Efficient Enumeration Of All Minimal Separators In A Graph Theoretical Computer Science, 180(1-2) 169\u2013180, 10 June 1997","journal-title":"Theoretical Computer Science"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1002\/net.3230230604","volume":"23","author":"A. Kanevsky","year":"1993","unstructured":"A. Kanevsky, Finding All Minimum Size Separating VertexSets In Graphs. NETWORKS, 23 533\u2013541,1993.","journal-title":"NETWORKS"},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S009753979427087X","volume":"27","author":"T. Kloks","year":"1998","unstructured":"T. Kloks and D. Kratsch, Listing All Minimal Separators Of A Graph SIAM J. Comput. 27(3) 605\u2013613 June 1998","journal-title":"SIAM J. Comput"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/S089548019223992X","volume":"8","author":"T. Kloks","year":"1995","unstructured":"T. Kloks, H. Bodlaender and D. Kratsch, Treewidth And Path Width Of Permutation Graphs SIAM J. Descrete Math. 8, 606\u2013616, 1995.","journal-title":"SIAM J. Descrete Math"},{"key":"34_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth-Computations And Approximations","author":"T. Kloks","year":"1994","unstructured":"T. Kloks, Treewidth-Computations And Approximations. Lecture Notes In Computer Science 842, Springer Verlag, Berlin 1994."},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1142\/S0129054196000099","volume":"7","author":"T. Kloks","year":"1996","unstructured":"T. Kloks, Treewidth Of Circle Graphs. Int. J. Of Foundations In Comp. Sci., 7 111\u2013120, 1996.","journal-title":"Int. J. Of Foundations In Comp. Sci"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1006\/jagm.1995.1037","volume":"19","author":"T. Kloks","year":"1995","unstructured":"T. Kloks and D. Kratsch, Treewidth Of Chordal Bipartite Graphsa. J. Algorithms, 19, 266\u2013281 1995.","journal-title":"J. Algorithms"},{"key":"34_CR15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-7091-9076-0_2","volume-title":"Computational Graph Theory","author":"R.H. Mohring","year":"1990","unstructured":"R.H. Mohring, Graph Problems Related To Gate MatrixL ayout And PLA Folding. Computational Graph Theory, Pages 17\u201352, Springer, Wein, New York,1990."},{"issue":"1","key":"34_CR16","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1006\/jagm.1997.0855","volume":"24","author":"M. R. Henzinger","year":"1997","unstructured":"Monika R Henzinger, A Static 2-Approximation Algorithm For Vertex Connectivity And An Incremental Approximation Algorithm For Edge And Vertex Connectivity. J. of Algorithms 24(1) 194\u2013220 July 1997","journal-title":"J. of Algorithms"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Monika R Henzinger, Satish Rao, and H.N. Gabow, Computing VertexConne ctivity: New Bounds From Old Techniques. 37th Anual Symposium On Foundations Of Computer Science, 462\u2013471 Oct. 1996.","DOI":"10.1109\/SFCS.1996.548505"},{"issue":"2","key":"34_CR18","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1137\/0220022","volume":"20","author":"S. Khuller","year":"1991","unstructured":"Samir Khuller and Baruch Schieber, k-Connectivity And Finding Disjoint s-t Paths In Graphs. SIAM J. Comp. 20(2) 352\u2013375 April 1991","journal-title":"SIAM J. Comp"},{"issue":"3","key":"34_CR19","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/0204034","volume":"4","author":"S. Even","year":"1975","unstructured":"Shimon Even, An Algorithm For Determining Whether The Connectivity Of A Graph Is At Least k. SIAM J. Comp. 4(3) 393\u2013396 September 1975.","journal-title":"SIAM J. Comp"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"M. Yannakakis, Computing The Minimum Fill-in Is NP-Complete SIAM J. on Alge. Discre. Math. 2 77\u201379, 1981.","journal-title":"SIAM J. on Alge. Discre. Math"},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"M. Yannakakis","year":"1984","unstructured":"M. Yannakakis and R.E. Tarjan, Simple Linear Time Algorithms To Test Chordality of Graphs, Test Acyclicity of hypergraphs and Selectively Reduce Acyclic Hypergraphs. SIAM J. Comput. 13,566\u2013579, 1984","journal-title":"SIAM J. Comput"},{"issue":"1","key":"34_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/0209016","volume":"9","author":"Z. Galil","year":"1980","unstructured":"Zvi Galil, Finding The Vertex Connectivity Of Graphs. SIAM J. Compu. 9(1) 197\u2013199 Feb 1980.","journal-title":"SIAM J. Compu"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T03:34:31Z","timestamp":1739849671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}