{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:56Z","timestamp":1725564956884},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_18","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"151-160","source":"Crossref","is-referenced-by-count":0,"title":["On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts"],"prefix":"10.1007","author":[{"given":"L. Sunil","family":"Chandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. S.","family":"Narayanaswamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: A characterisation of rigid circuit graphs. Discrete Mathematics\u00a09, 205\u2013212 (1974)","journal-title":"Discrete Mathematics"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-44679-6_42","volume-title":"Computing and Combinatorics","author":"L.S. Chandran","year":"2001","unstructured":"Chandran, L.S.: Edge connectivity vs vertex connectivity in chordal graphs. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, p. 384. Springer, Heidelberg (2001)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-44679-6_34","volume-title":"Computing and Combinatorics","author":"L. Sunil Chandran","year":"2001","unstructured":"Sunil Chandran, L.: A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 308\u2013317. Springer, Heidelberg (2001)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-45071-8_39","volume-title":"Computing and Combinatorics","author":"L.S. Chandran","year":"2003","unstructured":"Chandran, L.S., Kavitha, T., Subramanian, C.R.: Isoperimetric inequalities and the width parameters of graphs. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 385\u2013395. Springer, Heidelberg (2003)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BF01581045","volume":"22","author":"R. Chandrasekaran","year":"1982","unstructured":"Chandrasekaran, R., Tamir, A.: Polynomially bounded algorithms for locating p-centres on a tree. Math. Programming\u00a022, 304\u2013315 (1982)","journal-title":"Math. Programming"},{"key":"18_CR6","first-page":"61","volume-title":"Theory of Graphs","author":"G. Chartrand","year":"1968","unstructured":"Chartrand, G., Harary, F.: Graphs with prescribed connectivities. In: Erdos, P., Katona, G. (eds.) Theory of Graphs, pp. 61\u201363. Akademiai Kiado, Budapest (1968)"},{"key":"18_CR7","volume-title":"Algorithmic Graph Theory And Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory And Perfect Graphs. Academic Press, New York (1980)"},{"key":"18_CR8","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: Computations And Approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"key":"18_CR10","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":"Mohring, R.H.: Graph Problems Related To Gate Matrix Layout And PLA Folding. In: Computational Graph Theory, pp. 17\u201352. Springer, Wein (1990)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0208031","volume":"8","author":"C. Papadimitriou","year":"1979","unstructured":"Papadimitriou, C., Yannakakis, M.: Scheduling interval ordered tasks. SIAM Journal of Computing\u00a08, 405\u2013409 (1979)","journal-title":"SIAM Journal of Computing"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D. Rose","year":"1970","unstructured":"Rose, D.: Triangulated graphs and the elimination process. J. Math. Ana. Appl.\u00a032, 597\u2013609 (1970)","journal-title":"J. Math. Ana. Appl."},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/B978-1-4832-3187-7.50018-0","volume-title":"Graph Theory and Computing","author":"D. Rose","year":"1972","unstructured":"Rose, D.: A graph theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Graph Theory and Computing, pp. 183\u2013217. Academic Press, London (1972)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. American J.Math\u00a054, 150\u2013168 (1932)","journal-title":"American J.Math"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum Fill\u2013in is NP\u2013complete. SIAM J. on Alge. Discre. Math.\u00a02, 77\u201379 (1981)","journal-title":"SIAM J. on Alge. Discre. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:29Z","timestamp":1620012389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}