{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:23Z","timestamp":1725544883677},"publisher-location":"Berlin, Heidelberg","reference-count":7,"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_23","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T12:00:37Z","timestamp":1265716837000},"page":"207-217","source":"Crossref","is-referenced-by-count":12,"title":["PC-Trees vs. PQ-Trees"],"prefix":"10.1007","author":[{"given":"Wen-Lian","family":"Hsu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"K.S. Booth and G.S. Lueker, Testing of the Consecutive Ones Property, Interval graphs, and Graph Planarity Using PQ-Tree Algorithms, J. Comptr. Syst. Sci. 13,3 (1976), 335\u2013379.","journal-title":"Comptr. Syst. Sci"},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"D.R. Fulkerson and O.A. Gross, Incidence Matrices and Interval Graphs, Pacific Journal of Math., (1965), 15:835\u2013855.","journal-title":"Pacific Journal of Math"},{"key":"23_CR3","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":"23_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/0022-0000(88)90006-2","volume":"37","author":"P.N. Klein","year":"1988","unstructured":"P.N. Klein and J.H. Reif, An efficient parallel algorithm for planarity, J. of Computer and System Science 37, (1988), 190\u2013246.","journal-title":"J. of Computer and System Science"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0218005","volume":"18","author":"N. Korte","year":"1989","unstructured":"N. Korte and R.H. M\u00f6hring, An Incremental Linear-Time Algorithm for Recognizing Interval Graphs, SIAM J. Comput. 18, 1989, 68\u201381.","journal-title":"SIAM J. Comput"},{"key":"23_CR6","first-page":"215","volume-title":"Theory of Graphs","author":"A. Lempel","year":"1967","unstructured":"A. Lempel, S. Even and I. Cederbaum, An Algorithm for Planarity Testing of Graphs, Theory of Graphs, ed., P. Rosenstiehl, Gordon and Breach, New York, (1967), 215\u2013232."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(98)00120-0","volume":"223","author":"W.K. Shih","year":"1999","unstructured":"W.K. Shih and W.L. Hsu, Note A new planarity test, Theoretical Computer Science 223, (1999), 179\u2013191.","journal-title":"Theoretical Computer Science"}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T21:40:37Z","timestamp":1551044437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}