{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:00:46Z","timestamp":1725796846654},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319091075"},{"type":"electronic","value":"9783319091082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09108-2_13","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T13:07:01Z","timestamp":1404479221000},"page":"192-206","source":"Crossref","is-referenced-by-count":1,"title":["The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages"],"prefix":"10.1007","author":[{"given":"H. N.","family":"de Ridder","sequence":"first","affiliation":[]},{"given":"N.","family":"de Ridder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. In: SIAM Monographs on Discrete Math. Appl., Philadelphia, vol.\u00a03 (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics\u00a0164, 51\u2013229 (2006)","journal-title":"Annals of Mathematics"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/jgt.3190110405","volume":"11","author":"V. Chv\u00e1tal","year":"1987","unstructured":"Chv\u00e1tal, V., Ho\u00e0ng, C.T., Mahadev, N.V.R., De Werra, D.: Four classes of perfectly orderable graphs. Journal of Graph Theory\u00a011(4), 481\u2013495 (1987)","journal-title":"Journal of Graph Theory"},{"issue":"10","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L. Cordella","year":"2004","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a026(10), 1367\u20131372 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph structure and monadic second-order logic. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"de Ridder, H.N., de Ridder, N.: The subgraph isomorphism problem on a class of hyperedge replacement languages. Technical report. Universit\u00e4t Konstanz, Fachbereich Informatik und Informationswissenschaft (2014)","DOI":"10.1007\/978-3-319-09108-2_13"},{"key":"13_CR7","unstructured":"de Ridder, H.N., et al.: Information System on\u00a0Graph\u00a0Classes and their Inclusions (ISGCI) (2001\u20132014), http:\/\/www.graphclasses.org"},{"issue":"23","key":"13_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M. Farber","year":"1983","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discrete Mathematics\u00a043(23), 173\u2013189 (1983)","journal-title":"Discrete Mathematics"},{"key":"13_CR9","unstructured":"Foggia, P., Sansone, C., Vento, M.: A performance comparison of five algorithms for graph isomorphism. In: Proceedings of the 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition, pp. 188\u2013199 (2001)"},{"key":"13_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"A. Habel","year":"1992","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol.\u00a0643. Springer, Heidelberg (1992)"},{"key":"13_CR12","unstructured":"K\u00f6nig, D.: Theorie der endlichen und unendlichen Graphen, Leipzig (1936)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Lee, J., Han, W.-S., Kasperovics, R., Lee, J.-H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. In: Proceedings of the 39th International Conference on Very Large Data Bases, pp. 133\u2013144 (2013)","DOI":"10.14778\/2535568.2448946"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific Publishing Co., Inc. (1997)","DOI":"10.1142\/9789812384720"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM\u00a023(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"13_CR16","unstructured":"Vento, M., Foggia, P.: The vflib graph matching library, http:\/\/mivia.unisa.it\/datasets\/graph-database\/vflib"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09108-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:17:53Z","timestamp":1689380273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09108-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091075","9783319091082"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09108-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}