{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:20Z","timestamp":1759637780951},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564027"},{"type":"electronic","value":"9783540475545"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56402-0_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:09:51Z","timestamp":1330254591000},"page":"11-16","source":"Crossref","is-referenced-by-count":8,"title":["A simple test for interval graphs"],"prefix":"10.1007","author":[{"given":"Wen-Lian","family":"Hsu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"2_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 for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-tree Algorithms, J. Comput Syst. Sci 13, 1976, 335\u2013379.","journal-title":"J. Comput Syst. Sci"},{"key":"2_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 J. Math. 15, 1965, 835\u2013855.","journal-title":"Pacific J. Math."},{"key":"2_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":"2_CR4","unstructured":"W.L. Hsu, The Recognition and Isomorphism Problems for Circular-Arc Graphs, submitted, 1989."},{"key":"2_CR5","first-page":"52","volume":"557","author":"W.L. Hsu","year":"1991","unstructured":"W.L. Hsu and T.H. Ma, Substitution Decomposition on Chordal Graphs and Applications, LNCS 557, 1991, 52\u201360.","journal-title":"LNCS"},{"key":"2_CR6","doi-asserted-by":"crossref","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":"2_CR7","first-page":"289","volume":"553","author":"K. Simon","year":"1991","unstructured":"K. Simon, A New simple linear Algorithms to Recognize Interval Graphs, LNCS 553, 1991, 289\u2013308.","journal-title":"LNCS"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"J. Spinrad, P4 Trees and Substitution Decomposition, Discrete Applied Math., to appear.","DOI":"10.1016\/0166-218X(92)90180-I"}],"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-56402-0_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:51:31Z","timestamp":1619571091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56402-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564027","9783540475545"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-56402-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}