{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T02:42:09Z","timestamp":1648608129498},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s00373-007-0706-3","type":"journal-article","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T11:26:17Z","timestamp":1183375577000},"page":"209-231","source":"Crossref","is-referenced-by-count":2,"title":["An O(n3)-Time Recognition Algorithm for hhds-free Graphs"],"prefix":"10.1007","volume":"23","author":[{"given":"Elaine M.","family":"Eschen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sritharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"706_CR1","unstructured":"Brandst\u00e4dt, A.: Problem session, Dagstuhl seminar on robust and approximative algorithms for particular graph classes, Seminar No. 04221. Wadern, Germany, May 2004"},{"key":"706_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM monographs on discrete mathematics and applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"706_CR3","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V.: Perfectly ordered graphs. Topics on perfect graphs. In: Berge, C., Chv\u00e1tal, V. (eds.) North-Holland, Amsterdam, 63\u201365 (1984)","DOI":"10.1016\/S0304-0208(08)72923-2"},{"key":"706_CR4","doi-asserted-by":"crossref","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg 25, 71\u201376 (1961)","DOI":"10.1007\/BF02992776"},{"key":"706_CR5","doi-asserted-by":"crossref","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discrete Math. 43, 173\u2013189 (1983)","DOI":"10.1016\/0012-365X(83)90154-1"},{"key":"706_CR6","doi-asserted-by":"crossref","unstructured":"Ho\u00e0ng, C.T., Khouzam, N.: On brittle graphs. J. Graph Theory 12, 391\u2013404 (1988)","DOI":"10.1002\/jgt.3190120310"},{"key":"706_CR7","unstructured":"Ho\u00e0ng, C.T., Sritharan, R.: Finding houses and holes in graphs. Theor. Comput. Sci. 259, 233\u2013244 (2001)"},{"key":"706_CR8","unstructured":"Jamison, B., Olariu, S.: On the semi-perfect elimination. Adv. Appl. Math. 9, 364\u2013376 (1988)"},{"key":"706_CR9","unstructured":"Lubiw, A.: Doubly lexical ordering of matrices. SIAM J. Comput. 16, 854\u2013879 (1987)"},{"key":"706_CR10","doi-asserted-by":"crossref","unstructured":"Middendorf, M., Pfeiffer, F.: On the complexity of recognizing perfectly orderable graphs. Discrete Math. 80, 327\u2013333 (1990)","DOI":"10.1016\/0012-365X(90)90251-C"},{"key":"706_CR11","unstructured":"Nikolopoulos, S.D., Palios, L.: Recognizing hh-free, hhd-free, and Welsh\u2013Powell opposition graphs. Discrete Math. Theor. Comput. Sci. 8, 65\u201382 (2006)"},{"key":"706_CR12","doi-asserted-by":"crossref","unstructured":"Nikolopoulos, S.D., Palios, L.: Recognizing hhds-free graphs. In: Proceedings of the 31st International Workshop on Graph Theoretic Concepts in Computer Science (WG 2005), Metz, France (2005)","DOI":"10.1007\/11604686_40"},{"key":"706_CR13","unstructured":"Rose, D.J., Tarjan, R.E., Leuker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266\u2013283 (1976)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0706-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0706-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0706-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:27Z","timestamp":1559055507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0706-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":13,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["706"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0706-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}