{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:39:01Z","timestamp":1725471541088},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540483816"},{"type":"electronic","value":"9783540483823"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11917496_16","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T06:16:13Z","timestamp":1161152173000},"page":"168-178","source":"Crossref","is-referenced-by-count":0,"title":["An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time"],"prefix":"10.1007","author":[{"given":"Andrew R.","family":"Curtis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clemente","family":"Izurieta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benson","family":"Joeris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Lundberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ross M.","family":"McConnell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. McGraw-Hill, Boston (2001)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B. Duschnik","year":"1941","unstructured":"Duschnik, B., Miller, E.W.: Partially ordered sets. Amer. J. Math.\u00a063, 600\u2013610 (1941)","journal-title":"Amer. J. Math."},{"key":"16_CR3","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":"16_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences\u00a030, 209\u2013221 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF00814403","volume":"9","author":"H. Kierstead","year":"1992","unstructured":"Kierstead, H., Trotter, W.T., Qin, J.: The dimension of cycle-free orders. Order\u00a09, 103\u2013110 (1992)","journal-title":"Order"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF00385814","volume":"8","author":"T. Ma","year":"1991","unstructured":"Ma, T., Spinrad, J.P.: Cycle-free partial orders and chordal comparability graphs. Order\u00a08, 49\u201361 (1991)","journal-title":"Order"},{"issue":"1-3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Mathematics\u00a0201(1-3), 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. Rose","year":"1976","unstructured":"Rose, D., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput.\u00a05, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"16_CR9","volume-title":"Efficient Graph Representations","author":"J. Spinrad","year":"2003","unstructured":"Spinrad, J.: Efficient Graph Representations. American Mathematical Society, Providence (2003)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Data structures and network algorithms. Society for Industrial and Applied Math., Philadelphia (1983)","DOI":"10.1137\/1.9781611970265"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic and Discrete Methods\u00a03, 303\u2013322 (1982)","journal-title":"SIAM J. Algebraic and Discrete Methods"}],"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\/11917496_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:42:29Z","timestamp":1619509349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11917496_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540483816","9783540483823"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11917496_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}