{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:16:29Z","timestamp":1725880589899},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_17","type":"book-chapter","created":{"date-parts":[[2017,2,20]],"date-time":"2017-02-20T01:12:36Z","timestamp":1487553156000},"page":"217-227","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques"],"prefix":"10.1007","author":[{"given":"Miros\u0142aw","family":"Kowaluk","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"issue":"13","key":"17_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1093\/bioinformatics\/btn163","volume":"24","author":"N Alon","year":"2008","unstructured":"Alon, N., Dao, P., Hajirasouliha, I., Hormozdiari, F., Sahinalp, S.C.: Biomolecular network motif counting and discovery by color coding. Bioinformatics (ISMB 2008) 24(13), 241\u2013249 (2008)","journal-title":"Bioinformatics (ISMB 2008)"},{"issue":"4","key":"17_CR2","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14(4), 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/jgt.3190070105","volume":"7","author":"FRK Chung","year":"1983","unstructured":"Chung, F.R.K., Grinstead, C.M.: A survey of bounds for classical ramsey numbers. J. Graph Theory 7, 25\u201337 (1983)","journal-title":"J. Graph Theory"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.tcs.2004.05.009","volume":"326","author":"F Eisenbrand","year":"2004","unstructured":"Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci. 326, 57\u201367 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"17_CR5","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.dam.2010.04.015","volume":"159","author":"EM Eschen","year":"2011","unstructured":"Eschen, E.M., Ho\u00e0ng, C.T., Spinrad, J., Sritharan, R.: On graphs without a C4 or a diamond. Discret. Appl. Math. 159(7), 581\u2013587 (2011)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"17_CR6","doi-asserted-by":"crossref","first-page":"1322","DOI":"10.1137\/140978211","volume":"29","author":"P Floderus","year":"2015","unstructured":"Floderus, P., Kowaluk, M., Lingas, A., Lundell, E.-M.: Detecting and counting small pattern graphs. SIAM J. Discret. Math. 29(3), 1322\u20131339 (2015)","journal-title":"SIAM J. Discret. Math."},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.tcs.2015.09.001","volume":"605","author":"P Floderus","year":"2015","unstructured":"Floderus, P., Kowaluk, M., Lingas, A., Lundell, E.-M.: Induced subgraph isomorphism: are some patterns substantially easier than others? Theoret. Comput. Sci. 605, 119\u2013128 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR8","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness. Bell Laboratories, Murray Hill (1979)"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.ipl.2008.10.012","volume":"109","author":"L G\u0105sieniec","year":"2009","unstructured":"G\u0105sieniec, L., Kowaluk, M., Lingas, A.: Faster multi-witnesses for Boolean matrix product. Inf. Process. Lett. 109, 242\u2013247 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"4\u20135","key":"17_CR10","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/j.dam.2012.01.024","volume":"161","author":"CT Ho\u00e0ng","year":"2013","unstructured":"Ho\u00e0ng, C.T., Kaminski, M., Sawada, J., Sritharan, R.: Finding and listing induced paths and cycles. Discret. Appl. Math. 161(4\u20135), 633\u2013641 (2013)","journal-title":"Discret. Appl. Math."},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7, 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"issue":"3\u20134","key":"17_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0020-0190(00)00047-8","volume":"74","author":"T Kloks","year":"2000","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3\u20134), 115\u2013121 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"17_CR13","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1137\/110859798","volume":"27","author":"M Kowaluk","year":"2013","unstructured":"Kowaluk, M., Lingas, A., Lundell, E.-M.: Counting and detecting small subgraphs via equations and matrix multiplication. SIAM J. Discret. Math. 27(2), 892\u2013909 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Min. Knowl. Disc. 11, 243\u2013271 (2005)","journal-title":"Data Min. Knowl. Disc."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Faster algorithms for rectangular matrix multiplication. In: Proceedings of 53rd Symposium on Foundations of Computer Science (FOCS), pp. 514\u2013523 (2012)","DOI":"10.1109\/FOCS.2012.80"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of 39th International Symposium on Symbolic and Algebraic Computation, pp. 296\u2013303 (2014)","DOI":"10.1145\/2608628.2608664"},{"issue":"2","key":"17_CR17","first-page":"415","volume":"26","author":"J Nes\u0306etr\u0306il","year":"1985","unstructured":"Nes\u0306etr\u0306il, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Math. Univ. Carol. 26(2), 415\u2013419 (1985)","journal-title":"Commentationes Math. Univ. Carol."},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S Olariu","year":"1988","unstructured":"Olariu, S.: Paw-free graphs. Inf. Process. Lett. 28, 53\u201354 (1988)","journal-title":"Inf. Process. Lett."},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/11427186_54","volume-title":"Experimental and Efficient Algorithms","author":"T Schank","year":"2005","unstructured":"Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 606\u2013609. Springer, Heidelberg (2005). doi: 10.1007\/11427186_54"},{"issue":"1","key":"17_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1640457.1640458","volume":"15","author":"C Wolinski","year":"2009","unstructured":"Wolinski, C., Kuchcinski, K., Raffin, E.: Automatic design of application-specific reconfigurable processor extensions with UPaK synthesis kernel. ACM Trans. Des. Autom. Electron. Syst. 15(1), 1\u201336 (2009)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"17_CR21","unstructured":"Vassilevska, V.: Efficient algorithms for path problems in weighted graphs. Ph.D. thesis, CMU, CMU-CS-08-147 (2008)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Williams, V.V., Wang, J.R., Williams, R., Yu, H.: Finding four-node subgraphs in triangle time. In: Proceedings of SODA, pp. 1671\u20131680 (2015)","DOI":"10.1137\/1.9781611973730.111"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Williams, V.V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proceedings of 44th Annual ACM Symposium on Theory of Computing (STOC), pp. 887\u2013898 (2012)","DOI":"10.1145\/2213977.2214056"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T10:54:18Z","timestamp":1498388058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}